./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_35acb71e-10b4-443d-bef2-45b33f5e5715/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_35acb71e-10b4-443d-bef2-45b33f5e5715/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_35acb71e-10b4-443d-bef2-45b33f5e5715/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_35acb71e-10b4-443d-bef2-45b33f5e5715/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_35acb71e-10b4-443d-bef2-45b33f5e5715/bin-2019/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_35acb71e-10b4-443d-bef2-45b33f5e5715/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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9fdfa874c4a41b156e998d9e6fe5a8270aecd034 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 13:35:24,699 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 13:35:24,700 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 13:35:24,707 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 13:35:24,708 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 13:35:24,708 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 13:35:24,709 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 13:35:24,710 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 13:35:24,711 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 13:35:24,712 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 13:35:24,713 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 13:35:24,713 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 13:35:24,714 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 13:35:24,714 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 13:35:24,715 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 13:35:24,716 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 13:35:24,716 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 13:35:24,717 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 13:35:24,719 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 13:35:24,720 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 13:35:24,721 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 13:35:24,722 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 13:35:24,723 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 13:35:24,723 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 13:35:24,724 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 13:35:24,724 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 13:35:24,725 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 13:35:24,725 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 13:35:24,726 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 13:35:24,727 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 13:35:24,727 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 13:35:24,728 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 13:35:24,728 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 13:35:24,728 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 13:35:24,728 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 13:35:24,729 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 13:35:24,729 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_35acb71e-10b4-443d-bef2-45b33f5e5715/bin-2019/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2018-12-01 13:35:24,739 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 13:35:24,739 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 13:35:24,740 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 13:35:24,740 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 13:35:24,741 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 13:35:24,741 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 13:35:24,741 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 13:35:24,741 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 13:35:24,741 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 13:35:24,741 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 13:35:24,742 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 13:35:24,742 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 13:35:24,742 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 13:35:24,742 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-01 13:35:24,742 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-01 13:35:24,742 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 13:35:24,742 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 13:35:24,742 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 13:35:24,742 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 13:35:24,743 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 13:35:24,743 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 13:35:24,743 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 13:35:24,743 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 13:35:24,743 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 13:35:24,743 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 13:35:24,743 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 13:35:24,743 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 13:35:24,743 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_35acb71e-10b4-443d-bef2-45b33f5e5715/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-memcleanup) ) 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 -> 9fdfa874c4a41b156e998d9e6fe5a8270aecd034 [2018-12-01 13:35:24,764 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 13:35:24,771 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 13:35:24,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 13:35:24,774 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 13:35:24,774 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 13:35:24,775 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_35acb71e-10b4-443d-bef2-45b33f5e5715/bin-2019/uautomizer/../../sv-benchmarks/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2018-12-01 13:35:24,809 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_35acb71e-10b4-443d-bef2-45b33f5e5715/bin-2019/uautomizer/data/9fb2f312a/7f733ecfd576420f9e7aaa7083111e60/FLAG3509bfe67 [2018-12-01 13:35:25,259 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 13:35:25,259 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_35acb71e-10b4-443d-bef2-45b33f5e5715/sv-benchmarks/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2018-12-01 13:35:25,266 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_35acb71e-10b4-443d-bef2-45b33f5e5715/bin-2019/uautomizer/data/9fb2f312a/7f733ecfd576420f9e7aaa7083111e60/FLAG3509bfe67 [2018-12-01 13:35:25,274 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_35acb71e-10b4-443d-bef2-45b33f5e5715/bin-2019/uautomizer/data/9fb2f312a/7f733ecfd576420f9e7aaa7083111e60 [2018-12-01 13:35:25,276 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 13:35:25,277 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-01 13:35:25,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 13:35:25,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 13:35:25,279 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 13:35:25,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 01:35:25" (1/1) ... [2018-12-01 13:35:25,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201b218f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:35:25, skipping insertion in model container [2018-12-01 13:35:25,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 01:35:25" (1/1) ... [2018-12-01 13:35:25,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 13:35:25,307 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 13:35:25,461 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 13:35:25,467 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 13:35:25,521 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 13:35:25,548 INFO L195 MainTranslator]: Completed translation [2018-12-01 13:35:25,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:35:25 WrapperNode [2018-12-01 13:35:25,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 13:35:25,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 13:35:25,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 13:35:25,549 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 13:35:25,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:35:25" (1/1) ... [2018-12-01 13:35:25,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:35:25" (1/1) ... [2018-12-01 13:35:25,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:35:25" (1/1) ... [2018-12-01 13:35:25,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:35:25" (1/1) ... [2018-12-01 13:35:25,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:35:25" (1/1) ... [2018-12-01 13:35:25,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:35:25" (1/1) ... [2018-12-01 13:35:25,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:35:25" (1/1) ... [2018-12-01 13:35:25,589 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 13:35:25,589 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 13:35:25,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 13:35:25,589 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 13:35:25,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:35:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35acb71e-10b4-443d-bef2-45b33f5e5715/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-01 13:35:25,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 13:35:25,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 13:35:25,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-01 13:35:25,621 INFO L138 BoogieDeclarations]: Found implementation of procedure search_list [2018-12-01 13:35:25,621 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2018-12-01 13:35:25,621 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 13:35:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-01 13:35:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-01 13:35:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-01 13:35:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-01 13:35:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-01 13:35:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-01 13:35:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-01 13:35:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-01 13:35:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-01 13:35:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-01 13:35:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-01 13:35:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-01 13:35:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-01 13:35:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-01 13:35:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-01 13:35:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-01 13:35:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-01 13:35:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-01 13:35:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-01 13:35:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-01 13:35:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-01 13:35:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-01 13:35:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-01 13:35:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-01 13:35:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-01 13:35:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-01 13:35:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-01 13:35:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-01 13:35:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-01 13:35:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-01 13:35:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-01 13:35:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-01 13:35:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-01 13:35:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-01 13:35:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-01 13:35:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-01 13:35:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-01 13:35:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-01 13:35:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-01 13:35:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-01 13:35:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-01 13:35:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-01 13:35:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-01 13:35:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-01 13:35:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-01 13:35:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-01 13:35:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-01 13:35:25,625 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-01 13:35:25,625 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-01 13:35:25,625 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-01 13:35:25,625 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-01 13:35:25,625 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-01 13:35:25,625 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-01 13:35:25,625 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-01 13:35:25,625 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-01 13:35:25,625 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-01 13:35:25,625 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-01 13:35:25,625 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-01 13:35:25,625 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-01 13:35:25,625 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-01 13:35:25,625 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-01 13:35:25,625 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-01 13:35:25,625 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-01 13:35:25,626 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-01 13:35:25,626 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-01 13:35:25,626 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-01 13:35:25,626 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-12-01 13:35:25,626 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-01 13:35:25,626 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-01 13:35:25,626 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-01 13:35:25,626 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-01 13:35:25,626 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-01 13:35:25,626 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-01 13:35:25,626 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-01 13:35:25,626 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-01 13:35:25,626 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-01 13:35:25,626 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-01 13:35:25,626 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-01 13:35:25,626 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-01 13:35:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-01 13:35:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-01 13:35:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-01 13:35:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-01 13:35:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-01 13:35:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-01 13:35:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-01 13:35:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-01 13:35:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-01 13:35:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-01 13:35:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-01 13:35:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-01 13:35:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-01 13:35:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-01 13:35:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-01 13:35:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-01 13:35:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-01 13:35:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-01 13:35:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-01 13:35:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-01 13:35:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-01 13:35:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-01 13:35:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-01 13:35:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-01 13:35:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure search_list [2018-12-01 13:35:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 13:35:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-01 13:35:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2018-12-01 13:35:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 13:35:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 13:35:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-01 13:35:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 13:35:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 13:35:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 13:35:25,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 13:35:25,844 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 13:35:25,844 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-01 13:35:25,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:35:25 BoogieIcfgContainer [2018-12-01 13:35:25,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 13:35:25,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 13:35:25,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 13:35:25,847 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 13:35:25,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 01:35:25" (1/3) ... [2018-12-01 13:35:25,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5108dfbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 01:35:25, skipping insertion in model container [2018-12-01 13:35:25,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:35:25" (2/3) ... [2018-12-01 13:35:25,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5108dfbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 01:35:25, skipping insertion in model container [2018-12-01 13:35:25,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:35:25" (3/3) ... [2018-12-01 13:35:25,849 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search_false-unreach-call_false-valid-memcleanup.i [2018-12-01 13:35:25,855 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 13:35:25,860 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-12-01 13:35:25,870 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2018-12-01 13:35:25,885 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 13:35:25,885 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 13:35:25,886 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-01 13:35:25,886 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 13:35:25,886 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 13:35:25,886 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 13:35:25,886 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 13:35:25,886 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 13:35:25,886 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 13:35:25,895 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-12-01 13:35:25,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-01 13:35:25,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:35:25,902 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:35:25,903 INFO L423 AbstractCegarLoop]: === Iteration 1 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-12-01 13:35:25,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:35:25,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1516979211, now seen corresponding path program 1 times [2018-12-01 13:35:25,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:35:25,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:35:25,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:25,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:35:25,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:35:26,006 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-01 13:35:26,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:35:26,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 13:35:26,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 13:35:26,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 13:35:26,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 13:35:26,019 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 3 states. [2018-12-01 13:35:26,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:35:26,077 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-12-01 13:35:26,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 13:35:26,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-01 13:35:26,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:35:26,083 INFO L225 Difference]: With dead ends: 68 [2018-12-01 13:35:26,084 INFO L226 Difference]: Without dead ends: 64 [2018-12-01 13:35:26,085 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-01 13:35:26,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-01 13:35:26,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-01 13:35:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-01 13:35:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-12-01 13:35:26,109 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 9 [2018-12-01 13:35:26,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:35:26,109 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-12-01 13:35:26,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 13:35:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-12-01 13:35:26,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-01 13:35:26,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:35:26,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:35:26,110 INFO L423 AbstractCegarLoop]: === Iteration 2 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-12-01 13:35:26,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:35:26,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1516979210, now seen corresponding path program 1 times [2018-12-01 13:35:26,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:35:26,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:35:26,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:26,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:35:26,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:35:26,136 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-01 13:35:26,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:35:26,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 13:35:26,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 13:35:26,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 13:35:26,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 13:35:26,138 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 3 states. [2018-12-01 13:35:26,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:35:26,166 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-12-01 13:35:26,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 13:35:26,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-01 13:35:26,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:35:26,167 INFO L225 Difference]: With dead ends: 60 [2018-12-01 13:35:26,167 INFO L226 Difference]: Without dead ends: 60 [2018-12-01 13:35:26,168 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-01 13:35:26,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-01 13:35:26,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-01 13:35:26,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-01 13:35:26,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-12-01 13:35:26,171 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 9 [2018-12-01 13:35:26,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:35:26,172 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-12-01 13:35:26,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 13:35:26,172 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-12-01 13:35:26,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-01 13:35:26,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:35:26,172 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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-01 13:35:26,173 INFO L423 AbstractCegarLoop]: === Iteration 3 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-12-01 13:35:26,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:35:26,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1399930366, now seen corresponding path program 1 times [2018-12-01 13:35:26,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:35:26,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:35:26,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:26,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:35:26,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:35:26,239 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-01 13:35:26,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:35:26,239 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35acb71e-10b4-443d-bef2-45b33f5e5715/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-01 13:35:26,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:35:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:35:26,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:35:26,334 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-01 13:35:26,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:35:26,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-01 13:35:26,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 13:35:26,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 13:35:26,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:35:26,350 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 6 states. [2018-12-01 13:35:26,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:35:26,522 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2018-12-01 13:35:26,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 13:35:26,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-12-01 13:35:26,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:35:26,523 INFO L225 Difference]: With dead ends: 110 [2018-12-01 13:35:26,524 INFO L226 Difference]: Without dead ends: 110 [2018-12-01 13:35:26,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-12-01 13:35:26,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-01 13:35:26,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 67. [2018-12-01 13:35:26,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-01 13:35:26,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-12-01 13:35:26,533 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 47 [2018-12-01 13:35:26,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:35:26,533 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-12-01 13:35:26,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 13:35:26,534 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-12-01 13:35:26,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-01 13:35:26,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:35:26,535 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:35:26,535 INFO L423 AbstractCegarLoop]: === Iteration 4 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-12-01 13:35:26,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:35:26,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1474040255, now seen corresponding path program 1 times [2018-12-01 13:35:26,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:35:26,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:35:26,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:26,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:35:26,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:35:26,614 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-01 13:35:26,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:35:26,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 13:35:26,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 13:35:26,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 13:35:26,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 13:35:26,616 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 5 states. [2018-12-01 13:35:26,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:35:26,714 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-12-01 13:35:26,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 13:35:26,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-01 13:35:26,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:35:26,716 INFO L225 Difference]: With dead ends: 81 [2018-12-01 13:35:26,716 INFO L226 Difference]: Without dead ends: 81 [2018-12-01 13:35:26,716 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-01 13:35:26,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-01 13:35:26,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2018-12-01 13:35:26,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-01 13:35:26,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2018-12-01 13:35:26,720 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 50 [2018-12-01 13:35:26,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:35:26,720 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2018-12-01 13:35:26,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 13:35:26,720 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2018-12-01 13:35:26,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-01 13:35:26,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:35:26,721 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:35:26,721 INFO L423 AbstractCegarLoop]: === Iteration 5 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-12-01 13:35:26,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:35:26,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1474040256, now seen corresponding path program 1 times [2018-12-01 13:35:26,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:35:26,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:35:26,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:26,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:35:26,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:35:26,789 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-01 13:35:26,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:35:26,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 13:35:26,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 13:35:26,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 13:35:26,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 13:35:26,790 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand 5 states. [2018-12-01 13:35:26,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:35:26,917 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-12-01 13:35:26,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 13:35:26,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-01 13:35:26,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:35:26,918 INFO L225 Difference]: With dead ends: 85 [2018-12-01 13:35:26,918 INFO L226 Difference]: Without dead ends: 85 [2018-12-01 13:35:26,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:35:26,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-01 13:35:26,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2018-12-01 13:35:26,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-01 13:35:26,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-12-01 13:35:26,923 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 50 [2018-12-01 13:35:26,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:35:26,924 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-12-01 13:35:26,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 13:35:26,924 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-12-01 13:35:26,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-01 13:35:26,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:35:26,925 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:35:26,925 INFO L423 AbstractCegarLoop]: === Iteration 6 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-12-01 13:35:26,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:35:26,925 INFO L82 PathProgramCache]: Analyzing trace with hash -963000911, now seen corresponding path program 1 times [2018-12-01 13:35:26,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:35:26,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:35:26,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:26,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:35:26,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:35:26,998 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-01 13:35:26,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:35:26,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 13:35:26,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 13:35:26,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 13:35:26,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:35:26,999 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 7 states. [2018-12-01 13:35:27,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:35:27,113 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2018-12-01 13:35:27,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 13:35:27,113 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-12-01 13:35:27,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:35:27,114 INFO L225 Difference]: With dead ends: 85 [2018-12-01 13:35:27,114 INFO L226 Difference]: Without dead ends: 85 [2018-12-01 13:35:27,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-01 13:35:27,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-01 13:35:27,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2018-12-01 13:35:27,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-01 13:35:27,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-12-01 13:35:27,120 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 55 [2018-12-01 13:35:27,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:35:27,120 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-12-01 13:35:27,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 13:35:27,120 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-12-01 13:35:27,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-01 13:35:27,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:35:27,121 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:35:27,122 INFO L423 AbstractCegarLoop]: === Iteration 7 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-12-01 13:35:27,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:35:27,122 INFO L82 PathProgramCache]: Analyzing trace with hash 14257742, now seen corresponding path program 1 times [2018-12-01 13:35:27,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:35:27,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:35:27,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:27,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:35:27,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:35:27,187 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-01 13:35:27,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:35:27,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 13:35:27,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 13:35:27,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 13:35:27,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:35:27,188 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 6 states. [2018-12-01 13:35:27,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:35:27,254 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-12-01 13:35:27,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 13:35:27,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-12-01 13:35:27,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:35:27,255 INFO L225 Difference]: With dead ends: 85 [2018-12-01 13:35:27,255 INFO L226 Difference]: Without dead ends: 85 [2018-12-01 13:35:27,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:35:27,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-01 13:35:27,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2018-12-01 13:35:27,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-01 13:35:27,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-12-01 13:35:27,259 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 57 [2018-12-01 13:35:27,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:35:27,259 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-12-01 13:35:27,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 13:35:27,259 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-12-01 13:35:27,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-01 13:35:27,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:35:27,260 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:35:27,260 INFO L423 AbstractCegarLoop]: === Iteration 8 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-12-01 13:35:27,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:35:27,260 INFO L82 PathProgramCache]: Analyzing trace with hash 14257743, now seen corresponding path program 1 times [2018-12-01 13:35:27,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:35:27,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:35:27,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:27,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:35:27,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:35:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-01 13:35:27,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:35:27,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 13:35:27,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 13:35:27,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 13:35:27,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-01 13:35:27,349 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 8 states. [2018-12-01 13:35:27,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:35:27,502 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2018-12-01 13:35:27,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 13:35:27,502 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-12-01 13:35:27,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:35:27,503 INFO L225 Difference]: With dead ends: 109 [2018-12-01 13:35:27,503 INFO L226 Difference]: Without dead ends: 109 [2018-12-01 13:35:27,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-12-01 13:35:27,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-01 13:35:27,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2018-12-01 13:35:27,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-01 13:35:27,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-12-01 13:35:27,506 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 57 [2018-12-01 13:35:27,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:35:27,507 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-12-01 13:35:27,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 13:35:27,507 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-12-01 13:35:27,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-01 13:35:27,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:35:27,507 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:35:27,507 INFO L423 AbstractCegarLoop]: === Iteration 9 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-12-01 13:35:27,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:35:27,508 INFO L82 PathProgramCache]: Analyzing trace with hash 64797246, now seen corresponding path program 1 times [2018-12-01 13:35:27,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:35:27,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:35:27,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:27,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:35:27,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:35:27,746 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 13:35:27,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:35:27,746 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35acb71e-10b4-443d-bef2-45b33f5e5715/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-01 13:35:27,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:35:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:35:27,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:35:27,868 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-01 13:35:27,870 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-01 13:35:27,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:27,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:27,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:27,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-12-01 13:35:27,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:35:27,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:35:27,918 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 39 [2018-12-01 13:35:27,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:27,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:27,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2018-12-01 13:35:27,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-12-01 13:35:27,980 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-01 13:35:27,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:27,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:27,986 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-01 13:35:27,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15 [2018-12-01 13:35:28,033 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-01 13:35:28,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:35:28,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2018-12-01 13:35:28,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-01 13:35:28,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-01 13:35:28,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-12-01 13:35:28,049 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 21 states. [2018-12-01 13:35:28,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:35:28,611 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-12-01 13:35:28,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-01 13:35:28,611 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2018-12-01 13:35:28,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:35:28,612 INFO L225 Difference]: With dead ends: 112 [2018-12-01 13:35:28,612 INFO L226 Difference]: Without dead ends: 112 [2018-12-01 13:35:28,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=931, Unknown=0, NotChecked=0, Total=1122 [2018-12-01 13:35:28,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-01 13:35:28,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2018-12-01 13:35:28,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-01 13:35:28,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2018-12-01 13:35:28,616 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 57 [2018-12-01 13:35:28,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:35:28,616 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2018-12-01 13:35:28,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-01 13:35:28,616 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2018-12-01 13:35:28,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-01 13:35:28,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:35:28,617 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:35:28,617 INFO L423 AbstractCegarLoop]: === Iteration 10 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-12-01 13:35:28,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:35:28,617 INFO L82 PathProgramCache]: Analyzing trace with hash 64797247, now seen corresponding path program 1 times [2018-12-01 13:35:28,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:35:28,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:35:28,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:28,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:35:28,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:35:28,906 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-01 13:35:28,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:35:28,907 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35acb71e-10b4-443d-bef2-45b33f5e5715/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-01 13:35:28,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:35:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:35:28,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:35:28,955 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-01 13:35:28,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:28,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:28,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 13:35:29,007 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-01 13:35:29,008 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-01 13:35:29,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:29,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:29,016 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-01 13:35:29,017 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-01 13:35:29,018 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:29,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:29,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:29,026 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-12-01 13:35:29,062 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 18 treesize of output 17 [2018-12-01 13:35:29,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:29,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:29,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2018-12-01 13:35:29,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-01 13:35:29,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-01 13:35:29,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:29,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:29,121 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-01 13:35:29,122 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-01 13:35:29,123 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:29,123 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:29,127 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-01 13:35:29,127 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:14 [2018-12-01 13:35:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 13:35:29,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:35:29,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 18 [2018-12-01 13:35:29,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-01 13:35:29,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-01 13:35:29,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-12-01 13:35:29,165 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 19 states. [2018-12-01 13:35:29,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:35:29,873 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2018-12-01 13:35:29,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-01 13:35:29,873 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2018-12-01 13:35:29,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:35:29,874 INFO L225 Difference]: With dead ends: 116 [2018-12-01 13:35:29,874 INFO L226 Difference]: Without dead ends: 116 [2018-12-01 13:35:29,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2018-12-01 13:35:29,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-01 13:35:29,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2018-12-01 13:35:29,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-01 13:35:29,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2018-12-01 13:35:29,878 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 57 [2018-12-01 13:35:29,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:35:29,878 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2018-12-01 13:35:29,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-01 13:35:29,878 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2018-12-01 13:35:29,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-01 13:35:29,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:35:29,879 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:35:29,879 INFO L423 AbstractCegarLoop]: === Iteration 11 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-12-01 13:35:29,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:35:29,879 INFO L82 PathProgramCache]: Analyzing trace with hash 561616018, now seen corresponding path program 1 times [2018-12-01 13:35:29,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:35:29,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:35:29,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:29,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:35:29,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:35:30,037 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-01 13:35:30,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:35:30,037 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35acb71e-10b4-443d-bef2-45b33f5e5715/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-01 13:35:30,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:35:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:35:30,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:35:30,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01 13:35:30,108 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-01 13:35:30,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:30,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:30,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:30,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-12-01 13:35:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 13:35:30,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:35:30,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 20 [2018-12-01 13:35:30,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-01 13:35:30,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-01 13:35:30,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-12-01 13:35:30,244 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 20 states. [2018-12-01 13:35:30,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:35:30,697 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-12-01 13:35:30,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-01 13:35:30,697 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2018-12-01 13:35:30,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:35:30,698 INFO L225 Difference]: With dead ends: 112 [2018-12-01 13:35:30,698 INFO L226 Difference]: Without dead ends: 112 [2018-12-01 13:35:30,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 56 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2018-12-01 13:35:30,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-01 13:35:30,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2018-12-01 13:35:30,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-01 13:35:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-12-01 13:35:30,701 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 62 [2018-12-01 13:35:30,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:35:30,702 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-12-01 13:35:30,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-01 13:35:30,702 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-12-01 13:35:30,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-01 13:35:30,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:35:30,702 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:35:30,703 INFO L423 AbstractCegarLoop]: === Iteration 12 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-12-01 13:35:30,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:35:30,703 INFO L82 PathProgramCache]: Analyzing trace with hash 587278576, now seen corresponding path program 1 times [2018-12-01 13:35:30,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:35:30,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:35:30,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:30,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:35:30,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:35:30,747 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-01 13:35:30,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:35:30,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 13:35:30,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 13:35:30,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 13:35:30,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:35:30,748 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 6 states. [2018-12-01 13:35:30,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:35:30,812 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-12-01 13:35:30,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 13:35:30,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-01 13:35:30,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:35:30,813 INFO L225 Difference]: With dead ends: 98 [2018-12-01 13:35:30,813 INFO L226 Difference]: Without dead ends: 98 [2018-12-01 13:35:30,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:35:30,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-01 13:35:30,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2018-12-01 13:35:30,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-01 13:35:30,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2018-12-01 13:35:30,817 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 64 [2018-12-01 13:35:30,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:35:30,818 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2018-12-01 13:35:30,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 13:35:30,818 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2018-12-01 13:35:30,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-01 13:35:30,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:35:30,819 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:35:30,819 INFO L423 AbstractCegarLoop]: === Iteration 13 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-12-01 13:35:30,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:35:30,820 INFO L82 PathProgramCache]: Analyzing trace with hash 637818079, now seen corresponding path program 2 times [2018-12-01 13:35:30,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:35:30,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:35:30,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:30,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:35:30,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:35:31,401 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 26 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 13:35:31,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:35:31,402 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35acb71e-10b4-443d-bef2-45b33f5e5715/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-01 13:35:31,407 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 13:35:31,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 13:35:31,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 13:35:31,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:35:31,509 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-01 13:35:31,511 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-01 13:35:31,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:31,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:31,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:31,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-12-01 13:35:31,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:35:31,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:35:31,577 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 39 [2018-12-01 13:35:31,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:31,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:31,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2018-12-01 13:35:31,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:31,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:31,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:31,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:36 [2018-12-01 13:35:31,703 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-01 13:35:31,706 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-01 13:35:31,717 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-01 13:35:31,719 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-01 13:35:31,719 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:31,721 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:31,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:35:31,729 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:40 [2018-12-01 13:35:32,124 WARN L180 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-01 13:35:32,518 WARN L180 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-01 13:35:32,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:35:32,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:35:32,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:35:32,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 70 [2018-12-01 13:35:32,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:32,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:35:32,543 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 66 treesize of output 81 [2018-12-01 13:35:32,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-01 13:35:32,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:35:32,548 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 27 treesize of output 31 [2018-12-01 13:35:32,548 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:32,553 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:32,559 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:32,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:32,569 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:78, output treesize:102 [2018-12-01 13:35:32,655 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 74 treesize of output 64 [2018-12-01 13:35:32,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2018-12-01 13:35:32,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:32,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:32,673 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-01 13:35:32,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:72 [2018-12-01 13:35:32,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:35:32,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:35:32,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2018-12-01 13:35:32,799 INFO L478 Elim1Store]: Elim1 applied some 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 1 case distinctions, treesize of input 31 treesize of output 30 [2018-12-01 13:35:32,800 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 13:35:32,815 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 29 treesize of output 23 [2018-12-01 13:35:32,816 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:35:32,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:35:32,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 13:35:32,826 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:67, output treesize:28 [2018-12-01 13:35:32,904 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 40 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-01 13:35:32,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:35:32,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 37 [2018-12-01 13:35:32,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-01 13:35:32,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-01 13:35:32,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1263, Unknown=0, NotChecked=0, Total=1406 [2018-12-01 13:35:32,929 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 38 states. [2018-12-01 13:35:34,410 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2018-12-01 13:35:35,202 WARN L180 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2018-12-01 13:35:36,486 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2018-12-01 13:35:37,299 WARN L180 SmtUtils]: Spent 791.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2018-12-01 13:35:38,580 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-12-01 13:35:39,452 WARN L180 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2018-12-01 13:35:40,855 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2018-12-01 13:35:41,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:35:41,494 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2018-12-01 13:35:41,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-01 13:35:41,495 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 64 [2018-12-01 13:35:41,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:35:41,496 INFO L225 Difference]: With dead ends: 128 [2018-12-01 13:35:41,496 INFO L226 Difference]: Without dead ends: 128 [2018-12-01 13:35:41,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 49 SyntacticMatches, 9 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=497, Invalid=3163, Unknown=0, NotChecked=0, Total=3660 [2018-12-01 13:35:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-01 13:35:41,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 104. [2018-12-01 13:35:41,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-01 13:35:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2018-12-01 13:35:41,503 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 64 [2018-12-01 13:35:41,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:35:41,504 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2018-12-01 13:35:41,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-01 13:35:41,504 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2018-12-01 13:35:41,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-01 13:35:41,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:35:41,506 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:35:41,506 INFO L423 AbstractCegarLoop]: === Iteration 14 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-12-01 13:35:41,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:35:41,507 INFO L82 PathProgramCache]: Analyzing trace with hash 637818080, now seen corresponding path program 2 times [2018-12-01 13:35:41,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:35:41,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:35:41,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:41,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 13:35:41,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:35:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:35:42,166 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2018-12-01 13:35:42,474 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 24 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 13:35:42,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:35:42,474 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35acb71e-10b4-443d-bef2-45b33f5e5715/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-01 13:35:42,479 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 13:35:42,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 13:35:42,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 13:35:42,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:35:42,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 13:35:42,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:42,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:42,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 13:35:42,651 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-01 13:35:42,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-01 13:35:42,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:42,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:42,663 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-01 13:35:42,664 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-01 13:35:42,664 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:42,665 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:42,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:42,671 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-12-01 13:35:42,749 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 18 treesize of output 17 [2018-12-01 13:35:42,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:42,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:42,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:34 [2018-12-01 13:35:42,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:43,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:43,033 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:43,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:43,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:43,047 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:51 [2018-12-01 13:35:43,050 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-01 13:35:43,053 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-01 13:35:43,068 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-01 13:35:43,071 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-01 13:35:43,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 13:35:43,083 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:47 [2018-12-01 13:35:45,932 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 35 [2018-12-01 13:35:46,937 WARN L180 SmtUtils]: Spent 963.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-01 13:35:46,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:35:46,946 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 21 treesize of output 24 [2018-12-01 13:35:46,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:46,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:35:46,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:35:46,963 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-01 13:35:46,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:46,979 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 26 treesize of output 27 [2018-12-01 13:35:46,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-01 13:35:46,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:35:46,983 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 16 treesize of output 23 [2018-12-01 13:35:46,984 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:46,987 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:46,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:47,004 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 24 treesize of output 31 [2018-12-01 13:35:47,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-01 13:35:47,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:35:47,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-01 13:35:47,009 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:47,013 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:47,016 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:47,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:47,027 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:73, output treesize:67 [2018-12-01 13:35:47,267 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 76 treesize of output 61 [2018-12-01 13:35:47,269 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:35:47,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-01 13:35:47,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:47,275 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 38 treesize of output 30 [2018-12-01 13:35:47,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:35:47,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:35:47,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-12-01 13:35:47,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-12-01 13:35:47,292 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:47,298 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-01 13:35:47,298 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 13:35:47,300 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:35:47,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 13:35:47,304 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:88, output treesize:23 [2018-12-01 13:35:47,404 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 35 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 13:35:47,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:35:47,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 42 [2018-12-01 13:35:47,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-01 13:35:47,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-01 13:35:47,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1650, Unknown=2, NotChecked=0, Total=1806 [2018-12-01 13:35:47,420 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand 43 states. [2018-12-01 13:35:50,479 WARN L180 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2018-12-01 13:35:56,589 WARN L180 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 94 DAG size of output: 61 [2018-12-01 13:35:59,100 WARN L180 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2018-12-01 13:36:01,827 WARN L180 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2018-12-01 13:36:07,846 WARN L180 SmtUtils]: Spent 5.97 s on a formula simplification. DAG size of input: 97 DAG size of output: 68 [2018-12-01 13:36:10,866 WARN L180 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2018-12-01 13:36:17,252 WARN L180 SmtUtils]: Spent 6.33 s on a formula simplification. DAG size of input: 109 DAG size of output: 76 [2018-12-01 13:36:20,432 WARN L180 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2018-12-01 13:36:21,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:36:21,345 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2018-12-01 13:36:21,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-01 13:36:21,346 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 64 [2018-12-01 13:36:21,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:36:21,347 INFO L225 Difference]: With dead ends: 132 [2018-12-01 13:36:21,347 INFO L226 Difference]: Without dead ends: 132 [2018-12-01 13:36:21,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1192 ImplicationChecksByTransitivity, 37.9s TimeCoverageRelationStatistics Valid=636, Invalid=4192, Unknown=2, NotChecked=0, Total=4830 [2018-12-01 13:36:21,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-01 13:36:21,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 107. [2018-12-01 13:36:21,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-01 13:36:21,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2018-12-01 13:36:21,350 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 64 [2018-12-01 13:36:21,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:36:21,350 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2018-12-01 13:36:21,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-01 13:36:21,350 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2018-12-01 13:36:21,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-01 13:36:21,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:36:21,350 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 13:36:21,350 INFO L423 AbstractCegarLoop]: === Iteration 15 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-12-01 13:36:21,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:36:21,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1941419947, now seen corresponding path program 1 times [2018-12-01 13:36:21,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:36:21,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:36:21,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:36:21,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 13:36:21,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:36:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:36:21,437 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-12-01 13:36:21,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:36:21,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-01 13:36:21,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-01 13:36:21,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 13:36:21,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-01 13:36:21,437 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand 12 states. [2018-12-01 13:36:21,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:36:21,567 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2018-12-01 13:36:21,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 13:36:21,567 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-12-01 13:36:21,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:36:21,567 INFO L225 Difference]: With dead ends: 108 [2018-12-01 13:36:21,567 INFO L226 Difference]: Without dead ends: 102 [2018-12-01 13:36:21,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-12-01 13:36:21,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-01 13:36:21,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-01 13:36:21,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-01 13:36:21,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2018-12-01 13:36:21,569 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 70 [2018-12-01 13:36:21,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:36:21,570 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2018-12-01 13:36:21,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-01 13:36:21,570 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-12-01 13:36:21,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-01 13:36:21,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:36:21,570 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:36:21,570 INFO L423 AbstractCegarLoop]: === Iteration 16 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-12-01 13:36:21,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:36:21,570 INFO L82 PathProgramCache]: Analyzing trace with hash 482244241, now seen corresponding path program 2 times [2018-12-01 13:36:21,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:36:21,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:36:21,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:36:21,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:36:21,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:36:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:36:22,135 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 16 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 13:36:22,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:36:22,135 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35acb71e-10b4-443d-bef2-45b33f5e5715/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-01 13:36:22,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 13:36:22,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 13:36:22,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 13:36:22,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:36:22,296 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-01 13:36:22,297 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-01 13:36:22,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:36:22,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:22,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:22,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-01 13:36:22,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:36:22,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:22,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:22,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:30 [2018-12-01 13:36:22,446 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-01 13:36:22,448 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-01 13:36:22,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01 13:36:22,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-01 13:36:22,457 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:36:22,458 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:22,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:36:22,463 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:50, output treesize:34 [2018-12-01 13:36:23,282 WARN L180 SmtUtils]: Spent 422.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-01 13:36:23,870 WARN L180 SmtUtils]: Spent 557.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-01 13:36:23,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:23,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:23,875 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-01 13:36:23,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:36:23,884 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 25 treesize of output 26 [2018-12-01 13:36:23,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-01 13:36:23,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:23,889 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 16 treesize of output 23 [2018-12-01 13:36:23,889 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:36:23,893 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:23,897 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:23,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:23,902 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2018-12-01 13:36:24,194 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 23 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 13:36:24,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:36:24,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 22] total 53 [2018-12-01 13:36:24,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-01 13:36:24,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-01 13:36:24,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2565, Unknown=1, NotChecked=0, Total=2756 [2018-12-01 13:36:24,209 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 53 states. [2018-12-01 13:36:25,403 WARN L180 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2018-12-01 13:36:27,500 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 91 DAG size of output: 52 [2018-12-01 13:36:28,564 WARN L180 SmtUtils]: Spent 972.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 35 [2018-12-01 13:36:29,705 WARN L180 SmtUtils]: Spent 912.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2018-12-01 13:36:31,837 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2018-12-01 13:36:33,136 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2018-12-01 13:36:35,469 WARN L180 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 103 DAG size of output: 61 [2018-12-01 13:36:37,511 WARN L180 SmtUtils]: Spent 939.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2018-12-01 13:36:38,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:36:38,702 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-12-01 13:36:38,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-01 13:36:38,703 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 69 [2018-12-01 13:36:38,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:36:38,703 INFO L225 Difference]: With dead ends: 114 [2018-12-01 13:36:38,703 INFO L226 Difference]: Without dead ends: 114 [2018-12-01 13:36:38,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=1004, Invalid=7005, Unknown=1, NotChecked=0, Total=8010 [2018-12-01 13:36:38,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-01 13:36:38,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 101. [2018-12-01 13:36:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-01 13:36:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-12-01 13:36:38,706 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 69 [2018-12-01 13:36:38,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:36:38,706 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-12-01 13:36:38,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-01 13:36:38,707 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-12-01 13:36:38,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-01 13:36:38,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:36:38,707 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:36:38,707 INFO L423 AbstractCegarLoop]: === Iteration 17 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-12-01 13:36:38,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:36:38,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1670951710, now seen corresponding path program 3 times [2018-12-01 13:36:38,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:36:38,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:36:38,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:36:38,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 13:36:38,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:36:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:36:39,587 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 73 [2018-12-01 13:36:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 23 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:36:40,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:36:40,145 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35acb71e-10b4-443d-bef2-45b33f5e5715/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-01 13:36:40,150 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-01 13:36:40,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-01 13:36:40,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 13:36:40,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:36:40,369 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-01 13:36:40,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-01 13:36:40,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:36:40,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:40,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:40,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-12-01 13:36:40,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:40,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:40,478 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 39 [2018-12-01 13:36:40,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:36:40,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:40,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2018-12-01 13:36:40,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:36:40,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:40,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:40,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:36 [2018-12-01 13:36:40,652 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-01 13:36:40,654 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-01 13:36:40,663 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-01 13:36:40,664 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-01 13:36:40,665 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:36:40,666 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:40,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:36:40,672 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:40 [2018-12-01 13:36:41,888 WARN L180 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-01 13:36:42,302 WARN L180 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-01 13:36:42,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:42,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:42,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:42,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 50 [2018-12-01 13:36:42,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:36:42,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:42,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 57 [2018-12-01 13:36:42,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-01 13:36:42,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:42,328 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 27 treesize of output 31 [2018-12-01 13:36:42,328 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:36:42,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:42,338 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:42,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:42,347 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:62, output treesize:78 [2018-12-01 13:36:42,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:36:42,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:42,544 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:36:42,545 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:42,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:42,554 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:51 [2018-12-01 13:36:42,555 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-01 13:36:42,558 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-01 13:36:42,569 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-01 13:36:42,571 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-01 13:36:42,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 13:36:42,580 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:47 [2018-12-01 13:36:50,783 WARN L180 SmtUtils]: Spent 936.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-12-01 13:36:52,778 WARN L180 SmtUtils]: Spent 829.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-12-01 13:36:52,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:52,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:52,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:52,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:52,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:52,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 103 [2018-12-01 13:36:52,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:36:52,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-12-01 13:36:52,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 16 [2018-12-01 13:36:52,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:52,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-01 13:36:52,824 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:36:52,828 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:52,833 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:52,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:52,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:52,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:52,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:52,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 123 [2018-12-01 13:36:52,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-12-01 13:36:52,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:52,863 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 42 treesize of output 43 [2018-12-01 13:36:52,863 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 13:36:52,868 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:52,878 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:52,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:52,893 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:109, output treesize:146 [2018-12-01 13:36:53,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:53,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2018-12-01 13:36:53,194 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 30 treesize of output 17 [2018-12-01 13:36:53,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:36:53,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-01 13:36:53,200 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 13:36:53,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:36:53,213 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-01 13:36:53,213 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:157, output treesize:119 [2018-12-01 13:36:53,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:53,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:53,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:53,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:53,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:53,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:36:53,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 91 [2018-12-01 13:36:53,404 INFO L478 Elim1Store]: Elim1 applied some 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 58 [2018-12-01 13:36:53,407 INFO L267 ElimStorePlain]: Start of recursive call 3: 17 dim-0 vars, End of recursive call: 17 dim-0 vars, and 7 xjuncts. [2018-12-01 13:36:53,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 35 [2018-12-01 13:36:53,464 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 13:36:53,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 41 [2018-12-01 13:36:53,465 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:36:53,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2018-12-01 13:36:53,471 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-01 13:36:53,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 49 [2018-12-01 13:36:53,473 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 13:36:53,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2018-12-01 13:36:53,479 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-01 13:36:53,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2018-12-01 13:36:53,485 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-01 13:36:53,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2018-12-01 13:36:53,490 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-01 13:36:53,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2018-12-01 13:36:53,579 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-01 13:36:53,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-12-01 13:36:53,581 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:36:53,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2018-12-01 13:36:53,583 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-01 13:36:53,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 56 [2018-12-01 13:36:53,590 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 13:36:53,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 56 [2018-12-01 13:36:53,595 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 13:36:53,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 52 [2018-12-01 13:36:53,600 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 13:36:53,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 52 [2018-12-01 13:36:53,604 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 13:36:53,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 22 dim-0 vars, and 11 xjuncts. [2018-12-01 13:36:53,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 33 dim-0 vars, and 11 xjuncts. [2018-12-01 13:36:53,851 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 2 variables, input treesize:120, output treesize:496 [2018-12-01 13:36:54,092 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:36:54,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:36:54,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 53 [2018-12-01 13:36:54,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-01 13:36:54,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-01 13:36:54,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=2608, Unknown=12, NotChecked=0, Total=2862 [2018-12-01 13:36:54,110 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 54 states. [2018-12-01 13:36:57,848 WARN L180 SmtUtils]: Spent 3.45 s on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2018-12-01 13:36:59,999 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2018-12-01 13:37:03,985 WARN L180 SmtUtils]: Spent 3.67 s on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2018-12-01 13:37:06,265 WARN L180 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2018-12-01 13:37:10,299 WARN L180 SmtUtils]: Spent 3.68 s on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2018-12-01 13:37:12,716 WARN L180 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2018-12-01 13:37:16,984 WARN L180 SmtUtils]: Spent 3.95 s on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2018-12-01 13:37:19,552 WARN L180 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2018-12-01 13:37:20,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:37:20,991 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2018-12-01 13:37:20,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-01 13:37:20,992 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 71 [2018-12-01 13:37:20,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:37:20,992 INFO L225 Difference]: With dead ends: 126 [2018-12-01 13:37:20,992 INFO L226 Difference]: Without dead ends: 126 [2018-12-01 13:37:20,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2036 ImplicationChecksByTransitivity, 39.5s TimeCoverageRelationStatistics Valid=782, Invalid=5848, Unknown=12, NotChecked=0, Total=6642 [2018-12-01 13:37:20,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-01 13:37:20,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2018-12-01 13:37:20,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-01 13:37:20,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2018-12-01 13:37:20,995 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 71 [2018-12-01 13:37:20,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:37:20,996 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2018-12-01 13:37:20,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-01 13:37:20,996 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-12-01 13:37:20,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-01 13:37:20,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:37:20,996 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:37:20,996 INFO L423 AbstractCegarLoop]: === Iteration 18 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-12-01 13:37:20,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:37:20,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1670951711, now seen corresponding path program 3 times [2018-12-01 13:37:20,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:37:20,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:37:20,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:37:20,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 13:37:20,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:37:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:37:21,994 WARN L180 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 90 [2018-12-01 13:37:22,448 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-12-01 13:37:23,274 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 11 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 13:37:23,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:37:23,275 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35acb71e-10b4-443d-bef2-45b33f5e5715/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-01 13:37:23,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-01 13:37:23,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-01 13:37:23,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 13:37:23,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:37:23,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 13:37:23,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:23,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:23,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 13:37:23,506 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-01 13:37:23,507 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-01 13:37:23,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:23,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:23,518 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-01 13:37:23,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-01 13:37:23,519 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:23,521 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:23,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:23,527 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-12-01 13:37:23,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:23,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:23,692 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 39 [2018-12-01 13:37:23,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:23,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-01 13:37:23,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:23,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:23,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:55 [2018-12-01 13:37:23,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:23,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:24,008 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:24,010 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:24,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:24,020 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:87, output treesize:57 [2018-12-01 13:37:24,021 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-01 13:37:24,024 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-01 13:37:24,036 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-01 13:37:24,038 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-01 13:37:24,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 13:37:24,049 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:53 [2018-12-01 13:37:30,988 WARN L180 SmtUtils]: Spent 865.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-12-01 13:37:32,809 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 39 [2018-12-01 13:37:32,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:32,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:32,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 40 [2018-12-01 13:37:32,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:32,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:32,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:32,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:32,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 50 [2018-12-01 13:37:32,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:32,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:32,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 66 [2018-12-01 13:37:32,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-01 13:37:32,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:32,875 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 27 treesize of output 31 [2018-12-01 13:37:32,876 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:32,893 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:32,901 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:32,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:32,922 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 24 treesize of output 31 [2018-12-01 13:37:32,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-01 13:37:32,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:32,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-01 13:37:32,926 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:32,929 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:32,933 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:32,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:32,948 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:96, output treesize:122 [2018-12-01 13:37:33,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:33,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:33,207 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:33,208 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:33,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:33,216 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:51 [2018-12-01 13:37:33,218 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-01 13:37:33,220 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-01 13:37:33,230 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-01 13:37:33,232 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-01 13:37:33,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 13:37:33,240 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:47 [2018-12-01 13:37:44,927 WARN L180 SmtUtils]: Spent 864.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-01 13:37:46,591 WARN L180 SmtUtils]: Spent 963.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-01 13:37:46,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:46,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:46,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:46,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:46,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 93 [2018-12-01 13:37:46,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:46,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:46,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:46,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:46,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:46,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:46,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-12-01 13:37:46,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:46,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:46,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:46,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:46,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:46,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 134 [2018-12-01 13:37:46,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-12-01 13:37:46,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:46,670 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 42 treesize of output 43 [2018-12-01 13:37:46,670 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:46,676 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:46,690 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:46,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:46,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:46,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:46,715 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 58 [2018-12-01 13:37:46,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-01 13:37:46,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:46,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 16 treesize of output 23 [2018-12-01 13:37:46,720 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:46,724 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:46,731 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:46,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:46,748 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:147, output treesize:163 [2018-12-01 13:37:47,488 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:37:47,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:47,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:47,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:47,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:47,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:47,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:47,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 190 [2018-12-01 13:37:47,498 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:37:47,510 INFO L478 Elim1Store]: Elim1 applied some 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 101 treesize of output 107 [2018-12-01 13:37:47,513 INFO L267 ElimStorePlain]: Start of recursive call 3: 17 dim-0 vars, End of recursive call: 17 dim-0 vars, and 7 xjuncts. [2018-12-01 13:37:47,597 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:37:47,601 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 2 case distinctions, treesize of input 112 treesize of output 122 [2018-12-01 13:37:47,602 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-01 13:37:47,604 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:37:47,608 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 2 case distinctions, treesize of input 102 treesize of output 112 [2018-12-01 13:37:47,609 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-01 13:37:47,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:47,611 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:37:47,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 118 [2018-12-01 13:37:47,613 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:47,614 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:37:47,615 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 90 treesize of output 80 [2018-12-01 13:37:47,615 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:47,618 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:37:47,622 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 2 case distinctions, treesize of input 96 treesize of output 106 [2018-12-01 13:37:47,622 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-01 13:37:47,624 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:37:47,624 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 96 treesize of output 86 [2018-12-01 13:37:47,624 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:47,627 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:37:47,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 116 [2018-12-01 13:37:47,632 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-01 13:37:47,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:37:47,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 91 [2018-12-01 13:37:47,783 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-01 13:37:47,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 73 [2018-12-01 13:37:47,785 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:37:47,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 73 [2018-12-01 13:37:47,787 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-01 13:37:47,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 89 [2018-12-01 13:37:47,795 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 13:37:47,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 85 [2018-12-01 13:37:47,801 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 13:37:47,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 85 [2018-12-01 13:37:47,807 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 13:37:47,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 95 [2018-12-01 13:37:47,814 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 13:37:48,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 22 dim-0 vars, and 11 xjuncts. [2018-12-01 13:37:48,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-12-01 13:37:48,259 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 9 [2018-12-01 13:37:48,259 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-12-01 13:37:48,271 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,280 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-01 13:37:48,281 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,289 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-12-01 13:37:48,293 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 9 [2018-12-01 13:37:48,294 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-12-01 13:37:48,306 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,317 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-01 13:37:48,317 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,325 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-12-01 13:37:48,331 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:37:48,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-01 13:37:48,332 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2018-12-01 13:37:48,346 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,356 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-01 13:37:48,357 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,366 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-12-01 13:37:48,371 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:37:48,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-01 13:37:48,371 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2018-12-01 13:37:48,384 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,402 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-01 13:37:48,402 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,410 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-12-01 13:37:48,414 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:37:48,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-12-01 13:37:48,415 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,427 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-01 13:37:48,427 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,437 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-01 13:37:48,438 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,446 INFO L267 ElimStorePlain]: Start of recursive call 34: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-12-01 13:37:48,450 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:37:48,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-12-01 13:37:48,451 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-01 13:37:48,463 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,476 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-01 13:37:48,476 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,484 INFO L267 ElimStorePlain]: Start of recursive call 38: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-12-01 13:37:48,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 9 [2018-12-01 13:37:48,489 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-12-01 13:37:48,505 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,515 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-01 13:37:48,515 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,524 INFO L267 ElimStorePlain]: Start of recursive call 42: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 72 [2018-12-01 13:37:48,528 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:37:48,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-01 13:37:48,529 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2018-12-01 13:37:48,543 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-01 13:37:48,554 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,562 INFO L267 ElimStorePlain]: Start of recursive call 46: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-12-01 13:37:48,566 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:37:48,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-01 13:37:48,567 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,579 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-01 13:37:48,580 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,591 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-01 13:37:48,591 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,599 INFO L267 ElimStorePlain]: Start of recursive call 50: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-12-01 13:37:48,604 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 9 [2018-12-01 13:37:48,604 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,618 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:37:48,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-01 13:37:48,619 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,630 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-01 13:37:48,630 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,641 INFO L267 ElimStorePlain]: Start of recursive call 54: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-12-01 13:37:48,645 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:37:48,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-01 13:37:48,646 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2018-12-01 13:37:48,658 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,668 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-01 13:37:48,669 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,677 INFO L267 ElimStorePlain]: Start of recursive call 58: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:37:48,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 33 dim-0 vars, and 11 xjuncts. [2018-12-01 13:37:48,863 INFO L202 ElimStorePlain]: Needed 61 recursive calls to eliminate 3 variables, input treesize:227, output treesize:529 [2018-12-01 13:37:49,268 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 23 proven. 48 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 13:37:49,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:37:49,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 52 [2018-12-01 13:37:49,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-01 13:37:49,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-01 13:37:49,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2532, Unknown=20, NotChecked=0, Total=2756 [2018-12-01 13:37:49,285 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 53 states. [2018-12-01 13:37:54,253 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2018-12-01 13:37:56,603 WARN L180 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2018-12-01 13:38:01,258 WARN L180 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2018-12-01 13:38:03,790 WARN L180 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2018-12-01 13:38:08,326 WARN L180 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2018-12-01 13:38:10,727 WARN L180 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2018-12-01 13:38:15,036 WARN L180 SmtUtils]: Spent 3.82 s on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2018-12-01 13:38:17,776 WARN L180 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2018-12-01 13:38:18,239 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 96 [2018-12-01 13:38:18,561 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 106 [2018-12-01 13:38:19,096 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 109 [2018-12-01 13:38:20,133 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2018-12-01 13:38:20,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:38:20,726 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2018-12-01 13:38:20,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-01 13:38:20,726 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 71 [2018-12-01 13:38:20,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:38:20,727 INFO L225 Difference]: With dead ends: 127 [2018-12-01 13:38:20,727 INFO L226 Difference]: Without dead ends: 127 [2018-12-01 13:38:20,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 47 SyntacticMatches, 12 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1959 ImplicationChecksByTransitivity, 54.5s TimeCoverageRelationStatistics Valid=800, Invalid=6152, Unknown=20, NotChecked=0, Total=6972 [2018-12-01 13:38:20,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-01 13:38:20,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2018-12-01 13:38:20,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-01 13:38:20,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2018-12-01 13:38:20,731 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 71 [2018-12-01 13:38:20,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:38:20,731 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2018-12-01 13:38:20,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-01 13:38:20,731 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2018-12-01 13:38:20,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-01 13:38:20,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:38:20,732 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:38:20,732 INFO L423 AbstractCegarLoop]: === Iteration 19 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-12-01 13:38:20,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:38:20,732 INFO L82 PathProgramCache]: Analyzing trace with hash 246818738, now seen corresponding path program 3 times [2018-12-01 13:38:20,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:38:20,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:38:20,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:38:20,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 13:38:20,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:38:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:38:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:38:22,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:38:22,500 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35acb71e-10b4-443d-bef2-45b33f5e5715/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-01 13:38:22,506 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-01 13:38:22,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-01 13:38:22,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 13:38:22,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:38:22,654 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-01 13:38:22,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:38:22,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:38:22,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-01 13:38:22,688 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-01 13:38:22,689 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-01 13:38:22,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:38:22,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:38:22,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:38:22,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-01 13:38:22,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:38:22,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:38:22,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:38:22,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:36 [2018-12-01 13:38:22,912 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-01 13:38:22,914 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-01 13:38:22,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:38:22,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:38:22,924 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-01 13:38:22,926 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-01 13:38:22,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:38:22,933 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:40 [2018-12-01 13:38:24,170 WARN L180 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-01 13:38:24,585 WARN L180 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-01 13:38:24,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:38:24,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:38:24,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-01 13:38:24,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:38:24,602 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 25 treesize of output 26 [2018-12-01 13:38:24,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-01 13:38:24,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:38:24,606 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 16 treesize of output 23 [2018-12-01 13:38:24,607 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:38:24,611 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:38:24,615 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:38:24,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:38:24,622 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:53 [2018-12-01 13:38:24,680 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-01 13:38:24,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:38:24,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:38:24,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2018-12-01 13:38:24,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:38:24,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:38:24,805 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:38:24,807 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:38:24,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:38:24,815 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:50 [2018-12-01 13:38:24,816 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-01 13:38:24,818 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-01 13:38:24,828 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-01 13:38:24,830 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-01 13:38:24,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 13:38:24,838 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:70, output treesize:46 [2018-12-01 13:38:27,536 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 34 [2018-12-01 13:38:28,565 WARN L180 SmtUtils]: Spent 971.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-12-01 13:38:28,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:38:28,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:38:28,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:38:28,571 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 20 treesize of output 21 [2018-12-01 13:38:28,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:38:28,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:38:28,591 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 63 [2018-12-01 13:38:28,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-01 13:38:28,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:38:28,596 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 27 treesize of output 31 [2018-12-01 13:38:28,597 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:38:28,601 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:38:28,607 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:38:28,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:38:28,623 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 24 treesize of output 31 [2018-12-01 13:38:28,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 16 [2018-12-01 13:38:28,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:38:28,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-01 13:38:28,627 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 13:38:28,630 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:38:28,634 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:38:28,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:38:28,644 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:87, output treesize:83 [2018-12-01 13:38:29,375 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:38:29,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:38:29,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 29] total 68 [2018-12-01 13:38:29,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-01 13:38:29,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-01 13:38:29,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=4306, Unknown=3, NotChecked=0, Total=4556 [2018-12-01 13:38:29,392 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 68 states. [2018-12-01 13:38:44,158 WARN L180 SmtUtils]: Spent 3.34 s on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2018-12-01 13:38:48,308 WARN L180 SmtUtils]: Spent 3.99 s on a formula simplification. DAG size of input: 155 DAG size of output: 46 [2018-12-01 13:38:52,287 WARN L180 SmtUtils]: Spent 3.79 s on a formula simplification. DAG size of input: 115 DAG size of output: 40 [2018-12-01 13:39:03,469 WARN L180 SmtUtils]: Spent 3.54 s on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2018-12-01 13:39:07,626 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 159 DAG size of output: 51 [2018-12-01 13:39:14,494 WARN L180 SmtUtils]: Spent 3.47 s on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2018-12-01 13:39:18,936 WARN L180 SmtUtils]: Spent 4.29 s on a formula simplification. DAG size of input: 170 DAG size of output: 59 [2018-12-01 13:39:28,444 WARN L180 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2018-12-01 13:39:33,231 WARN L180 SmtUtils]: Spent 4.66 s on a formula simplification. DAG size of input: 179 DAG size of output: 67 [2018-12-01 13:39:34,168 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2018-12-01 13:39:34,462 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 56 [2018-12-01 13:39:35,397 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2018-12-01 13:39:35,675 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2018-12-01 13:39:36,221 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 57 [2018-12-01 13:39:39,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:39:39,034 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2018-12-01 13:39:39,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-01 13:39:39,034 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 76 [2018-12-01 13:39:39,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:39:39,035 INFO L225 Difference]: With dead ends: 123 [2018-12-01 13:39:39,035 INFO L226 Difference]: Without dead ends: 123 [2018-12-01 13:39:39,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3431 ImplicationChecksByTransitivity, 56.7s TimeCoverageRelationStatistics Valid=1308, Invalid=10891, Unknown=11, NotChecked=0, Total=12210 [2018-12-01 13:39:39,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-01 13:39:39,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 116. [2018-12-01 13:39:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-01 13:39:39,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2018-12-01 13:39:39,038 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 76 [2018-12-01 13:39:39,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:39:39,038 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2018-12-01 13:39:39,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-01 13:39:39,038 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2018-12-01 13:39:39,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-01 13:39:39,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:39:39,039 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:39:39,039 INFO L423 AbstractCegarLoop]: === Iteration 20 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-12-01 13:39:39,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:39:39,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1234657281, now seen corresponding path program 4 times [2018-12-01 13:39:39,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:39:39,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:39:39,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:39:39,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 13:39:39,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:39:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:39:39,726 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2018-12-01 13:39:40,251 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-12-01 13:39:40,711 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 51 [2018-12-01 13:39:43,198 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 83 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 13:39:43,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:39:43,198 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35acb71e-10b4-443d-bef2-45b33f5e5715/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-01 13:39:43,204 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-01 13:39:43,237 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-01 13:39:43,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 13:39:43,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:39:43,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 13:39:43,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 13:39:43,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:39:43,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:39:43,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:39:43,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2018-12-01 13:39:43,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-12-01 13:39:43,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:39:43,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-01 13:39:43,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:39:43,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:39:43,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:39:43,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:16 [2018-12-01 13:39:45,399 WARN L180 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-12-01 13:39:45,404 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-01 13:39:45,405 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-01 13:39:45,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:39:45,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:39:45,420 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-01 13:39:45,421 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-01 13:39:45,421 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:39:45,423 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:39:45,430 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-01 13:39:45,430 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-12-01 13:39:47,310 WARN L180 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-01 13:39:47,790 WARN L180 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-01 13:39:47,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:39:47,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:39:47,795 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 39 [2018-12-01 13:39:47,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:39:47,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-12-01 13:39:47,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-12-01 13:39:47,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:39:47,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-01 13:39:47,813 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:39:47,815 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:39:47,819 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:39:47,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:39:47,825 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:52 [2018-12-01 13:39:48,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:39:48,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:39:48,461 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:39:48,463 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:39:48,474 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-01 13:39:48,474 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:92, output treesize:62 [2018-12-01 13:39:49,445 WARN L180 SmtUtils]: Spent 553.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-12-01 13:39:49,447 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-01 13:39:49,450 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-01 13:39:49,466 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-01 13:39:49,469 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-01 13:39:49,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-01 13:39:49,481 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:93, output treesize:69 [2018-12-01 13:40:06,010 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 45 [2018-12-01 13:40:09,095 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 45 [2018-12-01 13:40:09,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:09,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:09,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:09,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-12-01 13:40:09,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:09,133 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 24 treesize of output 25 [2018-12-01 13:40:09,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-01 13:40:09,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:09,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 16 treesize of output 23 [2018-12-01 13:40:09,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:09,144 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:09,150 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:09,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 39 [2018-12-01 13:40:09,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-12-01 13:40:09,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:09,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-01 13:40:09,178 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:09,181 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:09,185 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:09,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:09,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 68 [2018-12-01 13:40:09,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-01 13:40:09,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:09,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-12-01 13:40:09,209 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:09,213 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:09,220 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:09,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:09,235 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:109, output treesize:108 [2018-12-01 13:40:09,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:09,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:09,610 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:09,612 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:09,622 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-01 13:40:09,622 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:56 [2018-12-01 13:40:12,179 WARN L180 SmtUtils]: Spent 530.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-12-01 13:40:12,181 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-01 13:40:12,184 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-01 13:40:12,197 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-01 13:40:12,199 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-01 13:40:12,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-01 13:40:12,210 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:63 [2018-12-01 13:40:38,505 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 41 [2018-12-01 13:40:42,782 WARN L180 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 41 [2018-12-01 13:40:42,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:42,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:42,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:42,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:42,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:42,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-12-01 13:40:42,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:42,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 47 [2018-12-01 13:40:42,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-12-01 13:40:42,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:42,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-01 13:40:42,836 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:42,840 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:42,844 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:42,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:42,870 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 52 [2018-12-01 13:40:42,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-01 13:40:42,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:42,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-01 13:40:42,876 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:42,880 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:42,887 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:42,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:42,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:42,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:42,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:42,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 127 [2018-12-01 13:40:42,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-12-01 13:40:42,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:42,916 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 42 treesize of output 43 [2018-12-01 13:40:42,916 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:42,922 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:42,933 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:42,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:42,948 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:151, output treesize:134 [2018-12-01 13:40:44,021 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:40:44,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:44,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:44,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:44,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:44,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:44,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:44,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 185 [2018-12-01 13:40:44,031 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:40:44,041 INFO L478 Elim1Store]: Elim1 applied some 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 108 treesize of output 102 [2018-12-01 13:40:44,044 INFO L267 ElimStorePlain]: Start of recursive call 3: 17 dim-0 vars, End of recursive call: 17 dim-0 vars, and 7 xjuncts. [2018-12-01 13:40:44,118 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:40:44,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 113 [2018-12-01 13:40:44,128 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-01 13:40:44,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:44,130 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:40:44,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 115 [2018-12-01 13:40:44,139 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,140 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:40:44,146 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 2 case distinctions, treesize of input 99 treesize of output 109 [2018-12-01 13:40:44,146 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-01 13:40:44,149 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:40:44,153 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 2 case distinctions, treesize of input 93 treesize of output 103 [2018-12-01 13:40:44,154 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-01 13:40:44,155 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:40:44,156 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 93 treesize of output 83 [2018-12-01 13:40:44,156 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,158 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:40:44,158 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 87 treesize of output 77 [2018-12-01 13:40:44,158 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,161 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:40:44,165 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 2 case distinctions, treesize of input 109 treesize of output 119 [2018-12-01 13:40:44,166 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-01 13:40:44,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 77 [2018-12-01 13:40:44,306 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 13:40:44,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2018-12-01 13:40:44,308 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:40:44,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2018-12-01 13:40:44,310 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-01 13:40:44,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 93 [2018-12-01 13:40:44,316 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 13:40:44,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 77 [2018-12-01 13:40:44,322 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 13:40:44,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 81 [2018-12-01 13:40:44,330 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 13:40:44,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:40:44,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2018-12-01 13:40:44,333 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-01 13:40:44,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 22 dim-0 vars, and 11 xjuncts. [2018-12-01 13:40:44,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-12-01 13:40:44,715 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:40:44,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-12-01 13:40:44,716 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,730 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-01 13:40:44,730 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,741 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-01 13:40:44,742 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,751 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-12-01 13:40:44,757 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:40:44,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-01 13:40:44,757 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,772 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-01 13:40:44,772 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,784 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-01 13:40:44,785 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,794 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-12-01 13:40:44,799 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:40:44,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-01 13:40:44,800 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,815 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-01 13:40:44,815 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,826 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-01 13:40:44,826 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,835 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-12-01 13:40:44,841 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:40:44,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-01 13:40:44,842 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,857 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-01 13:40:44,857 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,868 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-01 13:40:44,868 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,880 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-12-01 13:40:44,886 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 9 [2018-12-01 13:40:44,887 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-12-01 13:40:44,901 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,913 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-01 13:40:44,913 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,923 INFO L267 ElimStorePlain]: Start of recursive call 34: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-12-01 13:40:44,929 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 9 [2018-12-01 13:40:44,929 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,944 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:40:44,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-01 13:40:44,944 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-01 13:40:44,957 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,966 INFO L267 ElimStorePlain]: Start of recursive call 38: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-12-01 13:40:44,972 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:40:44,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-12-01 13:40:44,973 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-01 13:40:44,987 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:44,998 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-01 13:40:44,999 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:45,008 INFO L267 ElimStorePlain]: Start of recursive call 42: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:45,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-12-01 13:40:45,014 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 9 [2018-12-01 13:40:45,014 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:45,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-12-01 13:40:45,027 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:45,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-01 13:40:45,039 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:45,048 INFO L267 ElimStorePlain]: Start of recursive call 46: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:45,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-12-01 13:40:45,054 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:40:45,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-01 13:40:45,055 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:45,069 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-01 13:40:45,069 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:45,081 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-01 13:40:45,081 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:45,090 INFO L267 ElimStorePlain]: Start of recursive call 50: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:45,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-12-01 13:40:45,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2018-12-01 13:40:45,107 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:45,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-12-01 13:40:45,120 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:45,131 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-01 13:40:45,131 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:45,137 INFO L267 ElimStorePlain]: Start of recursive call 54: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:45,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-12-01 13:40:45,142 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:40:45,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-12-01 13:40:45,142 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:45,153 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-01 13:40:45,153 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:45,161 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-01 13:40:45,161 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:45,168 INFO L267 ElimStorePlain]: Start of recursive call 58: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:45,261 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-01 13:40:45,261 INFO L202 ElimStorePlain]: Needed 61 recursive calls to eliminate 3 variables, input treesize:190, output treesize:14 [2018-12-01 13:40:45,494 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-01 13:40:45,496 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-01 13:40:45,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:40:45,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:40:45,502 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-01 13:40:45,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-12-01 13:40:45,916 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 30 proven. 65 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 13:40:45,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:40:45,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 70 [2018-12-01 13:40:45,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-01 13:40:45,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-01 13:40:45,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=4618, Unknown=42, NotChecked=0, Total=4830 [2018-12-01 13:40:45,932 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand 70 states. [2018-12-01 13:41:35,943 WARN L180 SmtUtils]: Spent 7.16 s on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2018-12-01 13:41:44,784 WARN L180 SmtUtils]: Spent 8.43 s on a formula simplification. DAG size of input: 177 DAG size of output: 67 [2018-12-01 13:41:52,192 WARN L180 SmtUtils]: Spent 6.83 s on a formula simplification. DAG size of input: 128 DAG size of output: 61 [2018-12-01 13:42:03,481 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2018-12-01 13:42:24,867 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2018-12-01 13:42:35,469 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2018-12-01 13:42:39,406 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2018-12-01 13:42:45,267 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 113 [2018-12-01 13:42:45,637 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2018-12-01 13:42:46,085 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 142 [2018-12-01 13:42:46,328 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 124 [2018-12-01 13:42:46,657 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 121 [2018-12-01 13:42:47,111 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 144 [2018-12-01 13:42:47,396 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 121 [2018-12-01 13:42:48,088 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 141 [2018-12-01 13:42:48,804 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2018-12-01 13:43:03,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:43:03,369 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2018-12-01 13:43:03,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-01 13:43:03,369 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 78 [2018-12-01 13:43:03,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:43:03,369 INFO L225 Difference]: With dead ends: 128 [2018-12-01 13:43:03,369 INFO L226 Difference]: Without dead ends: 0 [2018-12-01 13:43:03,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3048 ImplicationChecksByTransitivity, 133.2s TimeCoverageRelationStatistics Valid=933, Invalid=13996, Unknown=77, NotChecked=0, Total=15006 [2018-12-01 13:43:03,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-01 13:43:03,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-01 13:43:03,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-01 13:43:03,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 13:43:03,370 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2018-12-01 13:43:03,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:43:03,371 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 13:43:03,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-01 13:43:03,371 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-01 13:43:03,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-01 13:43:03,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 01:43:03 BoogieIcfgContainer [2018-12-01 13:43:03,374 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 13:43:03,374 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 13:43:03,374 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 13:43:03,374 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 13:43:03,374 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:35:25" (3/4) ... [2018-12-01 13:43:03,377 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-01 13:43:03,381 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-01 13:43:03,381 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure insert_list [2018-12-01 13:43:03,382 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-01 13:43:03,382 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-12-01 13:43:03,382 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure search_list [2018-12-01 13:43:03,385 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-01 13:43:03,385 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-01 13:43:03,385 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-01 13:43:03,409 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_35acb71e-10b4-443d-bef2-45b33f5e5715/bin-2019/uautomizer/witness.graphml [2018-12-01 13:43:03,410 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 13:43:03,410 INFO L168 Benchmark]: Toolchain (without parser) took 458133.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 957.1 MB in the beginning and 859.2 MB in the end (delta: 97.9 MB). Peak memory consumption was 224.3 MB. Max. memory is 11.5 GB. [2018-12-01 13:43:03,410 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-01 13:43:03,411 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-01 13:43:03,411 INFO L168 Benchmark]: Boogie Preprocessor took 40.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 13:43:03,411 INFO L168 Benchmark]: RCFGBuilder took 255.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2018-12-01 13:43:03,411 INFO L168 Benchmark]: TraceAbstraction took 457528.70 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -1.0 MB). Free memory was 1.1 GB in the beginning and 866.1 MB in the end (delta: 189.5 MB). Peak memory consumption was 188.5 MB. Max. memory is 11.5 GB. [2018-12-01 13:43:03,411 INFO L168 Benchmark]: Witness Printer took 35.69 ms. Allocated memory is still 1.2 GB. Free memory was 866.1 MB in the beginning and 859.2 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-01 13:43:03,412 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 271.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 255.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 457528.70 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -1.0 MB). Free memory was 1.1 GB in the beginning and 866.1 MB in the end (delta: 189.5 MB). Peak memory consumption was 188.5 MB. Max. memory is 11.5 GB. * Witness Printer took 35.69 ms. Allocated memory is still 1.2 GB. Free memory was 866.1 MB in the beginning and 859.2 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 635]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 635]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 655]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 654]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 655]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 654]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 643]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 72 locations, 19 error locations. SAFE Result, 457.4s OverallTime, 20 OverallIterations, 5 TraceHistogramMax, 325.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 965 SDtfs, 4377 SDslu, 5141 SDs, 0 SdLazy, 18387 SolverSat, 1233 SolverUnsat, 72 SolverUnknown, 0 SolverNotchecked, 98.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1414 GetRequests, 566 SyntacticMatches, 70 SemanticMatches, 778 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15561 ImplicationChecksByTransitivity, 348.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred 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, 20 MinimizatonAttempts, 244 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 130.8s InterpolantComputationTime, 1853 NumberOfCodeBlocks, 1849 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1822 ConstructedInterpolants, 115 QuantifiedInterpolants, 3672463 SizeOfPredicates, 233 NumberOfNonLiveVariables, 4301 ConjunctsInSsa, 915 ConjunctsInUnsatCore, 31 InterpolantComputations, 9 PerfectInterpolantSequences, 905/1608 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...