./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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_00ea5629-8559-4109-b0cb-29a85947b795/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_00ea5629-8559-4109-b0cb-29a85947b795/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_00ea5629-8559-4109-b0cb-29a85947b795/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_00ea5629-8559-4109-b0cb-29a85947b795/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_00ea5629-8559-4109-b0cb-29a85947b795/bin-2019/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_00ea5629-8559-4109-b0cb-29a85947b795/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-0cd3be1 [2018-11-28 12:30:40,954 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:30:40,955 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:30:40,963 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:30:40,963 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:30:40,963 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:30:40,964 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:30:40,966 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:30:40,967 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:30:40,967 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:30:40,968 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:30:40,968 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:30:40,969 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:30:40,970 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:30:40,970 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:30:40,971 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:30:40,971 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:30:40,973 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:30:40,974 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:30:40,975 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:30:40,976 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:30:40,977 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:30:40,978 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:30:40,978 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:30:40,979 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:30:40,979 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:30:40,980 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:30:40,980 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:30:40,981 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:30:40,982 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:30:40,982 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:30:40,982 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:30:40,982 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:30:40,983 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:30:40,983 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:30:40,984 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:30:40,984 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_00ea5629-8559-4109-b0cb-29a85947b795/bin-2019/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2018-11-28 12:30:40,994 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:30:40,994 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:30:40,994 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:30:40,995 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:30:40,995 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:30:40,995 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:30:40,995 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:30:40,996 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:30:40,996 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:30:40,996 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:30:40,996 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:30:40,996 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:30:40,996 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:30:40,996 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 12:30:40,996 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 12:30:40,997 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:30:40,997 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:30:40,997 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:30:40,997 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:30:40,997 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:30:40,997 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:30:40,997 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:30:40,998 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:30:40,998 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:30:40,998 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:30:40,998 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:30:40,998 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:30:40,998 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_00ea5629-8559-4109-b0cb-29a85947b795/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-11-28 12:30:41,021 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:30:41,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:30:41,030 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:30:41,030 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:30:41,031 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:30:41,031 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_00ea5629-8559-4109-b0cb-29a85947b795/bin-2019/uautomizer/../../sv-benchmarks/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2018-11-28 12:30:41,066 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_00ea5629-8559-4109-b0cb-29a85947b795/bin-2019/uautomizer/data/38fa8b2f8/3b978db5778041359c16d7123ee1a12e/FLAG3907e4603 [2018-11-28 12:30:41,434 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:30:41,435 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_00ea5629-8559-4109-b0cb-29a85947b795/sv-benchmarks/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2018-11-28 12:30:41,445 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_00ea5629-8559-4109-b0cb-29a85947b795/bin-2019/uautomizer/data/38fa8b2f8/3b978db5778041359c16d7123ee1a12e/FLAG3907e4603 [2018-11-28 12:30:41,826 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_00ea5629-8559-4109-b0cb-29a85947b795/bin-2019/uautomizer/data/38fa8b2f8/3b978db5778041359c16d7123ee1a12e [2018-11-28 12:30:41,829 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:30:41,829 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 12:30:41,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:30:41,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:30:41,833 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:30:41,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:30:41" (1/1) ... [2018-11-28 12:30:41,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72b0f4a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:30:41, skipping insertion in model container [2018-11-28 12:30:41,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:30:41" (1/1) ... [2018-11-28 12:30:41,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:30:41,863 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:30:42,040 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:30:42,048 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:30:42,118 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:30:42,141 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:30:42,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:30:42 WrapperNode [2018-11-28 12:30:42,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:30:42,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:30:42,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:30:42,142 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:30:42,149 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:30:42" (1/1) ... [2018-11-28 12:30:42,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:30:42" (1/1) ... [2018-11-28 12:30:42,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:30:42" (1/1) ... [2018-11-28 12:30:42,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:30:42" (1/1) ... [2018-11-28 12:30:42,171 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:30:42" (1/1) ... [2018-11-28 12:30:42,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:30:42" (1/1) ... [2018-11-28 12:30:42,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:30:42" (1/1) ... [2018-11-28 12:30:42,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:30:42,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:30:42,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:30:42,181 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:30:42,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:30:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00ea5629-8559-4109-b0cb-29a85947b795/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-11-28 12:30:42,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 12:30:42,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:30:42,212 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 12:30:42,213 INFO L138 BoogieDeclarations]: Found implementation of procedure search_list [2018-11-28 12:30:42,213 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2018-11-28 12:30:42,213 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 12:30:42,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 12:30:42,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 12:30:42,213 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 12:30:42,213 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 12:30:42,213 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 12:30:42,214 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 12:30:42,214 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 12:30:42,214 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 12:30:42,214 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 12:30:42,214 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 12:30:42,214 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 12:30:42,214 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 12:30:42,214 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 12:30:42,214 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 12:30:42,214 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 12:30:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 12:30:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 12:30:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 12:30:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 12:30:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 12:30:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 12:30:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 12:30:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 12:30:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 12:30:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 12:30:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 12:30:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 12:30:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 12:30:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 12:30:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 12:30:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 12:30:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 12:30:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 12:30:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 12:30:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 12:30:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 12:30:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 12:30:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 12:30:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 12:30:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 12:30:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 12:30:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 12:30:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 12:30:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 12:30:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 12:30:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 12:30:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 12:30:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 12:30:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 12:30:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 12:30:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 12:30:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 12:30:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 12:30:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 12:30:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 12:30:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 12:30:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 12:30:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 12:30:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 12:30:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 12:30:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 12:30:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 12:30:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 12:30:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 12:30:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 12:30:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 12:30:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-28 12:30:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 12:30:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 12:30:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 12:30:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 12:30:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 12:30:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 12:30:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 12:30:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 12:30:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 12:30:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 12:30:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 12:30:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 12:30:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 12:30:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 12:30:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 12:30:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 12:30:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 12:30:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 12:30:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 12:30:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 12:30:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 12:30:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 12:30:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 12:30:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 12:30:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 12:30:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 12:30:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 12:30:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 12:30:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 12:30:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 12:30:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 12:30:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 12:30:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 12:30:42,221 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 12:30:42,221 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 12:30:42,221 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 12:30:42,221 INFO L130 BoogieDeclarations]: Found specification of procedure search_list [2018-11-28 12:30:42,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:30:42,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 12:30:42,221 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2018-11-28 12:30:42,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:30:42,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:30:42,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 12:30:42,221 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 12:30:42,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:30:42,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 12:30:42,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:30:42,497 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:30:42,498 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 12:30:42,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:30:42 BoogieIcfgContainer [2018-11-28 12:30:42,498 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:30:42,499 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:30:42,499 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:30:42,501 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:30:42,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:30:41" (1/3) ... [2018-11-28 12:30:42,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf36a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:30:42, skipping insertion in model container [2018-11-28 12:30:42,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:30:42" (2/3) ... [2018-11-28 12:30:42,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf36a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:30:42, skipping insertion in model container [2018-11-28 12:30:42,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:30:42" (3/3) ... [2018-11-28 12:30:42,504 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search_false-unreach-call_false-valid-memcleanup.i [2018-11-28 12:30:42,512 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:30:42,518 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-11-28 12:30:42,530 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2018-11-28 12:30:42,549 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:30:42,550 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:30:42,550 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 12:30:42,550 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:30:42,550 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:30:42,550 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:30:42,550 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:30:42,550 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:30:42,550 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:30:42,563 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-11-28 12:30:42,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 12:30:42,570 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:30:42,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:30:42,572 INFO L423 AbstractCegarLoop]: === Iteration 1 === [insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-11-28 12:30:42,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:30:42,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1516979211, now seen corresponding path program 1 times [2018-11-28 12:30:42,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:30:42,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:30:42,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:42,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:30:42,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:30:42,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:30:42,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:30:42,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:30:42,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:30:42,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:30:42,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:30:42,712 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 3 states. [2018-11-28 12:30:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:30:42,793 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-11-28 12:30:42,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:30:42,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-28 12:30:42,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:30:42,801 INFO L225 Difference]: With dead ends: 68 [2018-11-28 12:30:42,801 INFO L226 Difference]: Without dead ends: 64 [2018-11-28 12:30:42,802 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-11-28 12:30:42,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-28 12:30:42,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-28 12:30:42,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-28 12:30:42,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-11-28 12:30:42,829 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 9 [2018-11-28 12:30:42,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:30:42,829 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-11-28 12:30:42,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:30:42,830 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-11-28 12:30:42,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 12:30:42,830 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:30:42,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:30:42,830 INFO L423 AbstractCegarLoop]: === Iteration 2 === [insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-11-28 12:30:42,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:30:42,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1516979210, now seen corresponding path program 1 times [2018-11-28 12:30:42,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:30:42,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:30:42,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:42,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:30:42,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:30:42,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:30:42,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:30:42,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:30:42,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:30:42,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:30:42,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:30:42,871 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 3 states. [2018-11-28 12:30:42,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:30:42,909 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-11-28 12:30:42,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:30:42,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-28 12:30:42,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:30:42,911 INFO L225 Difference]: With dead ends: 60 [2018-11-28 12:30:42,911 INFO L226 Difference]: Without dead ends: 60 [2018-11-28 12:30:42,911 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-11-28 12:30:42,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-28 12:30:42,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-28 12:30:42,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-28 12:30:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-11-28 12:30:42,917 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 9 [2018-11-28 12:30:42,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:30:42,917 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-11-28 12:30:42,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:30:42,918 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-11-28 12:30:42,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 12:30:42,919 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:30:42,919 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-11-28 12:30:42,920 INFO L423 AbstractCegarLoop]: === Iteration 3 === [insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-11-28 12:30:42,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:30:42,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1399930366, now seen corresponding path program 1 times [2018-11-28 12:30:42,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:30:42,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:30:42,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:42,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:30:42,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:30:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 12:30:43,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:30:43,008 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00ea5629-8559-4109-b0cb-29a85947b795/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-11-28 12:30:43,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:30:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:30:43,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:30:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 12:30:43,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:30:43,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 12:30:43,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:30:43,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:30:43,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:30:43,140 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 6 states. [2018-11-28 12:30:43,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:30:43,332 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2018-11-28 12:30:43,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 12:30:43,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-11-28 12:30:43,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:30:43,334 INFO L225 Difference]: With dead ends: 110 [2018-11-28 12:30:43,334 INFO L226 Difference]: Without dead ends: 110 [2018-11-28 12:30:43,335 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-11-28 12:30:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-28 12:30:43,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 67. [2018-11-28 12:30:43,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-28 12:30:43,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-11-28 12:30:43,342 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 47 [2018-11-28 12:30:43,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:30:43,342 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-11-28 12:30:43,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:30:43,342 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-11-28 12:30:43,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 12:30:43,343 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:30:43,343 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-11-28 12:30:43,343 INFO L423 AbstractCegarLoop]: === Iteration 4 === [insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-11-28 12:30:43,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:30:43,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1474040255, now seen corresponding path program 1 times [2018-11-28 12:30:43,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:30:43,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:30:43,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:43,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:30:43,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:30:43,424 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-28 12:30:43,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:30:43,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:30:43,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:30:43,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:30:43,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:30:43,425 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 5 states. [2018-11-28 12:30:43,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:30:43,548 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-11-28 12:30:43,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:30:43,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-11-28 12:30:43,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:30:43,550 INFO L225 Difference]: With dead ends: 81 [2018-11-28 12:30:43,550 INFO L226 Difference]: Without dead ends: 81 [2018-11-28 12:30:43,550 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-11-28 12:30:43,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-28 12:30:43,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2018-11-28 12:30:43,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-28 12:30:43,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2018-11-28 12:30:43,556 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 50 [2018-11-28 12:30:43,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:30:43,557 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2018-11-28 12:30:43,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:30:43,557 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2018-11-28 12:30:43,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 12:30:43,562 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:30:43,562 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-11-28 12:30:43,562 INFO L423 AbstractCegarLoop]: === Iteration 5 === [insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-11-28 12:30:43,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:30:43,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1474040256, now seen corresponding path program 1 times [2018-11-28 12:30:43,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:30:43,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:30:43,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:43,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:30:43,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:30:43,673 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-28 12:30:43,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:30:43,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:30:43,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:30:43,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:30:43,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:30:43,674 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand 5 states. [2018-11-28 12:30:43,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:30:43,776 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-11-28 12:30:43,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:30:43,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-11-28 12:30:43,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:30:43,778 INFO L225 Difference]: With dead ends: 85 [2018-11-28 12:30:43,778 INFO L226 Difference]: Without dead ends: 85 [2018-11-28 12:30:43,778 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-11-28 12:30:43,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-28 12:30:43,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2018-11-28 12:30:43,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 12:30:43,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-11-28 12:30:43,784 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 50 [2018-11-28 12:30:43,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:30:43,785 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-11-28 12:30:43,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:30:43,785 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-11-28 12:30:43,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 12:30:43,786 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:30:43,786 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-11-28 12:30:43,787 INFO L423 AbstractCegarLoop]: === Iteration 6 === [insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-11-28 12:30:43,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:30:43,787 INFO L82 PathProgramCache]: Analyzing trace with hash -963000911, now seen corresponding path program 1 times [2018-11-28 12:30:43,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:30:43,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:30:43,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:43,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:30:43,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:30:43,869 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-28 12:30:43,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:30:43,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:30:43,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:30:43,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:30:43,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:30:43,871 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 7 states. [2018-11-28 12:30:44,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:30:44,029 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2018-11-28 12:30:44,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:30:44,030 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-11-28 12:30:44,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:30:44,031 INFO L225 Difference]: With dead ends: 85 [2018-11-28 12:30:44,031 INFO L226 Difference]: Without dead ends: 85 [2018-11-28 12:30:44,031 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-11-28 12:30:44,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-28 12:30:44,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2018-11-28 12:30:44,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 12:30:44,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-11-28 12:30:44,036 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 55 [2018-11-28 12:30:44,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:30:44,036 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-11-28 12:30:44,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:30:44,036 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-11-28 12:30:44,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 12:30:44,039 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:30:44,039 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-11-28 12:30:44,039 INFO L423 AbstractCegarLoop]: === Iteration 7 === [insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-11-28 12:30:44,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:30:44,039 INFO L82 PathProgramCache]: Analyzing trace with hash 14257742, now seen corresponding path program 1 times [2018-11-28 12:30:44,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:30:44,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:30:44,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:44,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:30:44,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:30:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-28 12:30:44,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:30:44,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:30:44,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:30:44,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:30:44,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:30:44,133 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 6 states. [2018-11-28 12:30:44,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:30:44,275 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-11-28 12:30:44,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:30:44,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-11-28 12:30:44,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:30:44,277 INFO L225 Difference]: With dead ends: 85 [2018-11-28 12:30:44,277 INFO L226 Difference]: Without dead ends: 85 [2018-11-28 12:30:44,277 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-11-28 12:30:44,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-28 12:30:44,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2018-11-28 12:30:44,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-28 12:30:44,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-11-28 12:30:44,283 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 57 [2018-11-28 12:30:44,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:30:44,284 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-11-28 12:30:44,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:30:44,284 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-11-28 12:30:44,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 12:30:44,285 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:30:44,285 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-11-28 12:30:44,285 INFO L423 AbstractCegarLoop]: === Iteration 8 === [insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-11-28 12:30:44,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:30:44,285 INFO L82 PathProgramCache]: Analyzing trace with hash 14257743, now seen corresponding path program 1 times [2018-11-28 12:30:44,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:30:44,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:30:44,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:44,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:30:44,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:30:44,425 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-28 12:30:44,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:30:44,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:30:44,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 12:30:44,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 12:30:44,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:30:44,426 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 8 states. [2018-11-28 12:30:44,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:30:44,610 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2018-11-28 12:30:44,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 12:30:44,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-11-28 12:30:44,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:30:44,611 INFO L225 Difference]: With dead ends: 109 [2018-11-28 12:30:44,611 INFO L226 Difference]: Without dead ends: 109 [2018-11-28 12:30:44,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:30:44,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-28 12:30:44,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2018-11-28 12:30:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-28 12:30:44,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-11-28 12:30:44,616 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 57 [2018-11-28 12:30:44,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:30:44,616 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-11-28 12:30:44,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 12:30:44,616 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-11-28 12:30:44,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 12:30:44,617 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:30:44,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-11-28 12:30:44,617 INFO L423 AbstractCegarLoop]: === Iteration 9 === [insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-11-28 12:30:44,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:30:44,617 INFO L82 PathProgramCache]: Analyzing trace with hash 64797246, now seen corresponding path program 1 times [2018-11-28 12:30:44,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:30:44,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:30:44,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:44,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:30:44,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:30:44,920 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 12:30:44,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:30:44,920 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00ea5629-8559-4109-b0cb-29a85947b795/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-11-28 12:30:44,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:30:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:30:44,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:30:45,048 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-11-28 12:30:45,050 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-11-28 12:30:45,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:30:45,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:45,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:45,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-28 12:30:45,101 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:30:45,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:30:45,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-11-28 12:30:45,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:30:45,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:45,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2018-11-28 12:30:45,163 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-11-28 12:30:45,165 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-11-28 12:30:45,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:30:45,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:45,173 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-11-28 12:30:45,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15 [2018-11-28 12:30:45,223 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 12:30:45,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:30:45,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2018-11-28 12:30:45,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 12:30:45,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 12:30:45,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-11-28 12:30:45,247 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 21 states. [2018-11-28 12:30:45,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:30:45,793 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-11-28 12:30:45,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 12:30:45,793 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2018-11-28 12:30:45,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:30:45,794 INFO L225 Difference]: With dead ends: 112 [2018-11-28 12:30:45,794 INFO L226 Difference]: Without dead ends: 112 [2018-11-28 12:30:45,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=931, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 12:30:45,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-28 12:30:45,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2018-11-28 12:30:45,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-28 12:30:45,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2018-11-28 12:30:45,800 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 57 [2018-11-28 12:30:45,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:30:45,800 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2018-11-28 12:30:45,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 12:30:45,800 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2018-11-28 12:30:45,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 12:30:45,801 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:30:45,801 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-11-28 12:30:45,801 INFO L423 AbstractCegarLoop]: === Iteration 10 === [insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-11-28 12:30:45,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:30:45,802 INFO L82 PathProgramCache]: Analyzing trace with hash 64797247, now seen corresponding path program 1 times [2018-11-28 12:30:45,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:30:45,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:30:45,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:45,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:30:45,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:30:46,084 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 12:30:46,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:30:46,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00ea5629-8559-4109-b0cb-29a85947b795/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-11-28 12:30:46,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:30:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:30:46,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:30:46,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:30:46,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:30:46,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:46,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:30:46,195 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-11-28 12:30:46,197 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-11-28 12:30:46,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:30:46,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:46,204 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-11-28 12:30:46,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 12:30:46,206 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:30:46,207 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:46,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:46,211 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-11-28 12:30:46,245 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-11-28 12:30:46,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:30:46,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:46,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2018-11-28 12:30:46,295 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-11-28 12:30:46,297 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-11-28 12:30:46,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:30:46,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:46,304 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-11-28 12:30:46,306 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-11-28 12:30:46,306 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:30:46,307 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:46,311 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-11-28 12:30:46,311 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:14 [2018-11-28 12:30:46,336 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 12:30:46,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:30:46,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 18 [2018-11-28 12:30:46,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 12:30:46,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 12:30:46,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-11-28 12:30:46,351 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 19 states. [2018-11-28 12:30:46,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:30:46,856 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2018-11-28 12:30:46,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 12:30:46,856 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2018-11-28 12:30:46,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:30:46,857 INFO L225 Difference]: With dead ends: 116 [2018-11-28 12:30:46,857 INFO L226 Difference]: Without dead ends: 116 [2018-11-28 12:30:46,858 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-11-28 12:30:46,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-28 12:30:46,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2018-11-28 12:30:46,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-28 12:30:46,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2018-11-28 12:30:46,861 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 57 [2018-11-28 12:30:46,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:30:46,861 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2018-11-28 12:30:46,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 12:30:46,861 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2018-11-28 12:30:46,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-28 12:30:46,863 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:30:46,863 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-11-28 12:30:46,863 INFO L423 AbstractCegarLoop]: === Iteration 11 === [insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-11-28 12:30:46,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:30:46,863 INFO L82 PathProgramCache]: Analyzing trace with hash 561616018, now seen corresponding path program 1 times [2018-11-28 12:30:46,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:30:46,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:30:46,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:46,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:30:46,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:30:47,041 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 12:30:47,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:30:47,041 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00ea5629-8559-4109-b0cb-29a85947b795/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-11-28 12:30:47,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:30:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:30:47,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:30:47,119 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-11-28 12:30:47,120 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-11-28 12:30:47,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:30:47,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:47,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:47,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-28 12:30:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 12:30:47,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:30:47,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 20 [2018-11-28 12:30:47,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 12:30:47,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 12:30:47,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-11-28 12:30:47,248 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 20 states. [2018-11-28 12:30:47,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:30:47,754 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-11-28 12:30:47,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-28 12:30:47,755 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2018-11-28 12:30:47,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:30:47,756 INFO L225 Difference]: With dead ends: 112 [2018-11-28 12:30:47,756 INFO L226 Difference]: Without dead ends: 112 [2018-11-28 12:30:47,757 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-11-28 12:30:47,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-28 12:30:47,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2018-11-28 12:30:47,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 12:30:47,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-11-28 12:30:47,760 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 62 [2018-11-28 12:30:47,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:30:47,761 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-11-28 12:30:47,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 12:30:47,761 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-11-28 12:30:47,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 12:30:47,762 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:30:47,762 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-11-28 12:30:47,762 INFO L423 AbstractCegarLoop]: === Iteration 12 === [insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-11-28 12:30:47,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:30:47,762 INFO L82 PathProgramCache]: Analyzing trace with hash 587278576, now seen corresponding path program 1 times [2018-11-28 12:30:47,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:30:47,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:30:47,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:47,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:30:47,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:30:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-28 12:30:47,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:30:47,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:30:47,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:30:47,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:30:47,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:30:47,845 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 6 states. [2018-11-28 12:30:47,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:30:47,918 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-11-28 12:30:47,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:30:47,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-28 12:30:47,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:30:47,920 INFO L225 Difference]: With dead ends: 98 [2018-11-28 12:30:47,920 INFO L226 Difference]: Without dead ends: 98 [2018-11-28 12:30:47,920 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-11-28 12:30:47,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-28 12:30:47,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2018-11-28 12:30:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-28 12:30:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2018-11-28 12:30:47,923 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 64 [2018-11-28 12:30:47,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:30:47,923 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2018-11-28 12:30:47,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:30:47,923 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2018-11-28 12:30:47,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 12:30:47,924 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:30:47,924 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-11-28 12:30:47,925 INFO L423 AbstractCegarLoop]: === Iteration 13 === [insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-11-28 12:30:47,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:30:47,925 INFO L82 PathProgramCache]: Analyzing trace with hash 637818079, now seen corresponding path program 2 times [2018-11-28 12:30:47,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:30:47,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:30:47,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:47,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:30:47,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:30:48,414 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-28 12:30:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 26 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:30:48,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:30:48,616 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00ea5629-8559-4109-b0cb-29a85947b795/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-11-28 12:30:48,622 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:30:48,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:30:48,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:30:48,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:30:48,730 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-11-28 12:30:48,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 12:30:48,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:30:48,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:48,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:48,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-28 12:30:48,793 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-11-28 12:30:48,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:30:48,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:48,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-11-28 12:30:48,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:30:48,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:48,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:48,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:36 [2018-11-28 12:30:48,887 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:30:48,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:30:48,900 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-11-28 12:30:48,902 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-11-28 12:30:48,902 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:30:48,903 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:48,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:30:48,916 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:40 [2018-11-28 12:30:49,311 WARN L180 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 12:30:49,710 WARN L180 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 12:30:49,717 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:30:49,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:30:49,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:30:49,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2018-11-28 12:30:49,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:30:49,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-11-28 12:30:49,735 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-11-28 12:30:49,737 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:30:49,738 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-11-28 12:30:49,738 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:30:49,741 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:49,746 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:49,756 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-11-28 12:30:49,756 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:62 [2018-11-28 12:30:49,822 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-11-28 12:30:49,824 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-11-28 12:30:49,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:30:49,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:49,836 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-11-28 12:30:49,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:54 [2018-11-28 12:30:49,960 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:30:49,962 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 50 treesize of output 41 [2018-11-28 12:30:49,964 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:30:49,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-28 12:30:49,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:30:49,971 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 14 treesize of output 10 [2018-11-28 12:30:49,972 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:30:49,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:30:49,982 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-11-28 12:30:49,982 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:55, output treesize:24 [2018-11-28 12:30:50,061 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 40 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:30:50,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:30:50,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 36 [2018-11-28 12:30:50,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-28 12:30:50,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-28 12:30:50,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1198, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 12:30:50,077 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 37 states. [2018-11-28 12:30:51,471 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 48 DAG size of output: 33 [2018-11-28 12:30:52,283 WARN L180 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2018-11-28 12:30:53,524 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2018-11-28 12:30:54,349 WARN L180 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2018-11-28 12:30:55,707 WARN L180 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2018-11-28 12:30:56,588 WARN L180 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2018-11-28 12:30:58,100 WARN L180 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2018-11-28 12:30:58,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:30:58,617 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2018-11-28 12:30:58,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-28 12:30:58,617 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 64 [2018-11-28 12:30:58,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:30:58,618 INFO L225 Difference]: With dead ends: 128 [2018-11-28 12:30:58,618 INFO L226 Difference]: Without dead ends: 128 [2018-11-28 12:30:58,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 49 SyntacticMatches, 10 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=477, Invalid=3063, Unknown=0, NotChecked=0, Total=3540 [2018-11-28 12:30:58,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-28 12:30:58,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 104. [2018-11-28 12:30:58,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-28 12:30:58,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2018-11-28 12:30:58,622 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 64 [2018-11-28 12:30:58,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:30:58,622 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2018-11-28 12:30:58,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-28 12:30:58,622 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2018-11-28 12:30:58,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 12:30:58,623 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:30:58,623 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-11-28 12:30:58,623 INFO L423 AbstractCegarLoop]: === Iteration 14 === [insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-11-28 12:30:58,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:30:58,623 INFO L82 PathProgramCache]: Analyzing trace with hash 637818080, now seen corresponding path program 2 times [2018-11-28 12:30:58,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:30:58,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:30:58,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:58,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:30:58,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:30:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:30:59,231 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2018-11-28 12:30:59,559 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 24 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:30:59,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:30:59,559 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00ea5629-8559-4109-b0cb-29a85947b795/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-11-28 12:30:59,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:30:59,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:30:59,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:30:59,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:30:59,607 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-11-28 12:30:59,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:30:59,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:59,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:30:59,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 12:30:59,738 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-11-28 12:30:59,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:30:59,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:59,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 12:30:59,752 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-11-28 12:30:59,752 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:30:59,753 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:59,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:59,759 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-11-28 12:30:59,838 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-11-28 12:30:59,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:30:59,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:30:59,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:34 [2018-11-28 12:31:00,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:31:00,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:31:00,018 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:31:00,020 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:31:00,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:31:00,029 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:51 [2018-11-28 12:31:00,031 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:31:00,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:31:00,046 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:31:00,048 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:31:00,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:31:00,056 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:47 [2018-11-28 12:31:03,404 WARN L180 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 12:31:04,293 WARN L180 SmtUtils]: Spent 850.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 12:31:04,300 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:31:04,301 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-11-28 12:31:04,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:31:04,316 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:31:04,317 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:31:04,318 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-11-28 12:31:04,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:31:04,332 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-11-28 12:31:04,334 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-11-28 12:31:04,336 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:31:04,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 12:31:04,337 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 12:31:04,341 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:31:04,345 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:31:04,358 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-11-28 12:31:04,360 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-11-28 12:31:04,362 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:31:04,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 12:31:04,364 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:31:04,367 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:31:04,371 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:31:04,381 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-11-28 12:31:04,381 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:73, output treesize:67 [2018-11-28 12:31:04,611 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-11-28 12:31:04,613 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:31:04,613 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-11-28 12:31:04,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:31:04,623 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-11-28 12:31:04,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:31:04,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:31:04,638 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-11-28 12:31:04,639 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-11-28 12:31:04,639 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 12:31:04,643 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-11-28 12:31:04,643 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:31:04,644 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:31:04,650 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-11-28 12:31:04,650 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:88, output treesize:23 [2018-11-28 12:31:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 35 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:31:04,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:31:04,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 42 [2018-11-28 12:31:04,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-28 12:31:04,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-28 12:31:04,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1650, Unknown=2, NotChecked=0, Total=1806 [2018-11-28 12:31:04,761 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand 43 states. [2018-11-28 12:31:07,560 WARN L180 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2018-11-28 12:31:13,615 WARN L180 SmtUtils]: Spent 6.01 s on a formula simplification. DAG size of input: 94 DAG size of output: 61 [2018-11-28 12:31:16,204 WARN L180 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2018-11-28 12:31:19,110 WARN L180 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2018-11-28 12:31:25,396 WARN L180 SmtUtils]: Spent 6.25 s on a formula simplification. DAG size of input: 97 DAG size of output: 68 [2018-11-28 12:31:28,501 WARN L180 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2018-11-28 12:31:34,908 WARN L180 SmtUtils]: Spent 6.36 s on a formula simplification. DAG size of input: 109 DAG size of output: 76 [2018-11-28 12:31:38,045 WARN L180 SmtUtils]: Spent 2.73 s on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2018-11-28 12:31:38,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:31:38,942 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2018-11-28 12:31:38,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-28 12:31:38,943 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 64 [2018-11-28 12:31:38,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:31:38,944 INFO L225 Difference]: With dead ends: 132 [2018-11-28 12:31:38,944 INFO L226 Difference]: Without dead ends: 132 [2018-11-28 12:31:38,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1192 ImplicationChecksByTransitivity, 38.5s TimeCoverageRelationStatistics Valid=636, Invalid=4192, Unknown=2, NotChecked=0, Total=4830 [2018-11-28 12:31:38,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-28 12:31:38,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 107. [2018-11-28 12:31:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-28 12:31:38,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2018-11-28 12:31:38,948 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 64 [2018-11-28 12:31:38,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:31:38,948 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2018-11-28 12:31:38,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-28 12:31:38,948 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2018-11-28 12:31:38,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 12:31:38,949 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:31:38,949 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-11-28 12:31:38,949 INFO L423 AbstractCegarLoop]: === Iteration 15 === [insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-11-28 12:31:38,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:31:38,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1941419947, now seen corresponding path program 1 times [2018-11-28 12:31:38,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:31:38,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:31:38,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:38,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:31:38,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:31:39,091 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-28 12:31:39,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:31:39,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 12:31:39,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 12:31:39,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 12:31:39,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-28 12:31:39,092 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand 12 states. [2018-11-28 12:31:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:31:39,253 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2018-11-28 12:31:39,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:31:39,254 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-28 12:31:39,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:31:39,254 INFO L225 Difference]: With dead ends: 108 [2018-11-28 12:31:39,255 INFO L226 Difference]: Without dead ends: 102 [2018-11-28 12:31:39,255 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-11-28 12:31:39,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-28 12:31:39,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-11-28 12:31:39,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-28 12:31:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2018-11-28 12:31:39,260 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 70 [2018-11-28 12:31:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:31:39,260 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2018-11-28 12:31:39,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 12:31:39,260 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-11-28 12:31:39,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 12:31:39,261 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:31:39,261 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-11-28 12:31:39,261 INFO L423 AbstractCegarLoop]: === Iteration 16 === [insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-11-28 12:31:39,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:31:39,261 INFO L82 PathProgramCache]: Analyzing trace with hash 482244241, now seen corresponding path program 2 times [2018-11-28 12:31:39,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:31:39,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:31:39,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:39,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:31:39,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:31:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 16 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:31:39,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:31:39,918 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00ea5629-8559-4109-b0cb-29a85947b795/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-11-28 12:31:39,925 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:31:39,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:31:39,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:31:39,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:31:40,068 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-11-28 12:31:40,069 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-11-28 12:31:40,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:31:40,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:31:40,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:31:40,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-28 12:31:40,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:31:40,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:31:40,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:31:40,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:30 [2018-11-28 12:31:40,217 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:31:40,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:31:40,227 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-11-28 12:31:40,228 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-11-28 12:31:40,228 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:31:40,230 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:31:40,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:31:40,235 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:50, output treesize:34 [2018-11-28 12:31:41,164 WARN L180 SmtUtils]: Spent 531.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-28 12:31:41,765 WARN L180 SmtUtils]: Spent 569.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-28 12:31:41,769 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:31:41,771 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:31:41,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11-28 12:31:41,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:31:41,785 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-11-28 12:31:41,787 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-11-28 12:31:41,790 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:31:41,792 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-11-28 12:31:41,792 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:31:41,795 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:31:41,799 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:31:41,805 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-11-28 12:31:41,806 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2018-11-28 12:31:42,093 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 23 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:31:42,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:31:42,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 22] total 53 [2018-11-28 12:31:42,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-28 12:31:42,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-28 12:31:42,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2565, Unknown=1, NotChecked=0, Total=2756 [2018-11-28 12:31:42,109 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 53 states. [2018-11-28 12:31:43,357 WARN L180 SmtUtils]: Spent 911.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2018-11-28 12:31:45,702 WARN L180 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 91 DAG size of output: 52 [2018-11-28 12:31:46,673 WARN L180 SmtUtils]: Spent 889.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 35 [2018-11-28 12:31:47,848 WARN L180 SmtUtils]: Spent 946.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2018-11-28 12:31:50,017 WARN L180 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2018-11-28 12:31:51,209 WARN L180 SmtUtils]: Spent 945.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2018-11-28 12:31:53,725 WARN L180 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 103 DAG size of output: 61 [2018-11-28 12:31:55,845 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2018-11-28 12:31:56,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:31:56,952 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-11-28 12:31:56,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-28 12:31:56,952 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 69 [2018-11-28 12:31:56,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:31:56,953 INFO L225 Difference]: With dead ends: 114 [2018-11-28 12:31:56,953 INFO L226 Difference]: Without dead ends: 114 [2018-11-28 12:31:56,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=1004, Invalid=7005, Unknown=1, NotChecked=0, Total=8010 [2018-11-28 12:31:56,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-28 12:31:56,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 101. [2018-11-28 12:31:56,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-28 12:31:56,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-11-28 12:31:56,957 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 69 [2018-11-28 12:31:56,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:31:56,957 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-11-28 12:31:56,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-28 12:31:56,958 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-11-28 12:31:56,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 12:31:56,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:31:56,958 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-11-28 12:31:56,959 INFO L423 AbstractCegarLoop]: === Iteration 17 === [insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-11-28 12:31:56,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:31:56,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1670951710, now seen corresponding path program 3 times [2018-11-28 12:31:56,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:31:56,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:31:56,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:56,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:31:56,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:31:57,986 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 73 [2018-11-28 12:31:58,527 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 23 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:31:58,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:31:58,527 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00ea5629-8559-4109-b0cb-29a85947b795/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-11-28 12:31:58,535 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 12:31:58,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 12:31:58,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:31:58,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:31:58,745 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-11-28 12:31:58,747 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-11-28 12:31:58,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:31:58,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:31:58,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:31:58,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-28 12:31:58,848 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:31:58,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:31:58,849 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-11-28 12:31:58,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:31:58,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:31:58,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2018-11-28 12:31:58,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:31:58,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:31:58,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:31:58,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:36 [2018-11-28 12:31:58,995 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:31:58,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:31:59,005 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-11-28 12:31:59,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 12:31:59,006 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:31:59,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:31:59,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:31:59,016 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:40 [2018-11-28 12:32:00,196 WARN L180 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 12:32:00,612 WARN L180 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 12:32:00,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:00,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:00,619 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:00,620 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-11-28 12:32:00,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:00,640 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:00,641 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-11-28 12:32:00,642 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-11-28 12:32:00,644 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:00,645 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-11-28 12:32:00,645 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:00,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:00,654 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:00,663 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-11-28 12:32:00,664 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:62, output treesize:78 [2018-11-28 12:32:00,711 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-11-28 12:32:00,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:00,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:00,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-11-28 12:32:00,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:00,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:00,879 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:00,880 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:00,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:00,890 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:86, output treesize:56 [2018-11-28 12:32:00,891 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:00,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:00,905 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:00,907 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:00,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:00,917 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:76, output treesize:52 [2018-11-28 12:32:03,450 WARN L180 SmtUtils]: Spent 963.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-28 12:32:04,523 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 38 [2018-11-28 12:32:04,529 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:04,530 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:04,531 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:04,531 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:04,532 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:04,533 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-11-28 12:32:04,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:04,560 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-11-28 12:32:04,562 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-11-28 12:32:04,565 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:04,566 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-11-28 12:32:04,566 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:04,571 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:04,577 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:04,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:04,605 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:04,606 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:04,608 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:04,608 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-11-28 12:32:04,611 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-11-28 12:32:04,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:04,614 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-11-28 12:32:04,614 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:04,619 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:04,629 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:04,645 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-11-28 12:32:04,645 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:114, output treesize:151 [2018-11-28 12:32:04,972 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:04,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-11-28 12:32:04,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:04,993 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:04,994 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 39 treesize of output 31 [2018-11-28 12:32:04,995 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-11-28 12:32:04,995 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:05,001 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:05,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 12:32:05,002 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:05,005 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:05,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:05,017 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:175, output treesize:127 [2018-11-28 12:32:05,218 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:05,218 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:05,219 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:05,219 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:05,220 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:05,221 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:05,221 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:05,222 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 117 treesize of output 102 [2018-11-28 12:32:05,224 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:05,236 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 47 treesize of output 67 [2018-11-28 12:32:05,241 INFO L267 ElimStorePlain]: Start of recursive call 3: 17 dim-0 vars, End of recursive call: 17 dim-0 vars, and 7 xjuncts. [2018-11-28 12:32:05,309 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-11-28 12:32:05,310 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 12:32:05,314 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-11-28 12:32:05,314 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 12:32:05,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 12:32:05,316 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:05,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, 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-11-28 12:32:05,317 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:05,319 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:05,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 55 [2018-11-28 12:32:05,321 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:05,325 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 66 treesize of output 59 [2018-11-28 12:32:05,326 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-28 12:32:05,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11-28 12:32:05,330 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-28 12:32:05,424 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-11-28 12:32:05,425 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:05,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:05,428 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 60 treesize of output 54 [2018-11-28 12:32:05,428 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:05,430 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-11-28 12:32:05,430 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:05,436 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-11-28 12:32:05,437 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 12:32:05,441 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-11-28 12:32:05,442 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 12:32:05,446 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-11-28 12:32:05,447 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 12:32:05,452 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-11-28 12:32:05,453 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 12:32:05,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 22 dim-0 vars, and 11 xjuncts. [2018-11-28 12:32:05,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 33 dim-0 vars, and 11 xjuncts. [2018-11-28 12:32:05,749 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 3 variables, input treesize:128, output treesize:496 [2018-11-28 12:32:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:06,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:32:06,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28] total 54 [2018-11-28 12:32:06,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-28 12:32:06,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-28 12:32:06,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=2720, Unknown=3, NotChecked=0, Total=2970 [2018-11-28 12:32:06,019 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 55 states. [2018-11-28 12:32:09,831 WARN L180 SmtUtils]: Spent 3.51 s on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2018-11-28 12:32:11,982 WARN L180 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2018-11-28 12:32:15,768 WARN L180 SmtUtils]: Spent 3.54 s on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2018-11-28 12:32:18,219 WARN L180 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2018-11-28 12:32:22,262 WARN L180 SmtUtils]: Spent 3.77 s on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2018-11-28 12:32:24,666 WARN L180 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2018-11-28 12:32:28,683 WARN L180 SmtUtils]: Spent 3.75 s on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2018-11-28 12:32:31,326 WARN L180 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2018-11-28 12:32:31,691 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2018-11-28 12:32:32,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:32,620 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2018-11-28 12:32:32,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-28 12:32:32,620 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 71 [2018-11-28 12:32:32,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:32,620 INFO L225 Difference]: With dead ends: 126 [2018-11-28 12:32:32,621 INFO L226 Difference]: Without dead ends: 126 [2018-11-28 12:32:32,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2104 ImplicationChecksByTransitivity, 33.0s TimeCoverageRelationStatistics Valid=789, Invalid=6014, Unknown=3, NotChecked=0, Total=6806 [2018-11-28 12:32:32,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-28 12:32:32,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2018-11-28 12:32:32,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-28 12:32:32,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2018-11-28 12:32:32,623 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 71 [2018-11-28 12:32:32,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:32,623 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2018-11-28 12:32:32,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-28 12:32:32,623 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-11-28 12:32:32,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 12:32:32,624 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:32,624 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-11-28 12:32:32,624 INFO L423 AbstractCegarLoop]: === Iteration 18 === [insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-11-28 12:32:32,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:32,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1670951711, now seen corresponding path program 3 times [2018-11-28 12:32:32,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:32,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:32,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:32,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:32:32,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:33,650 WARN L180 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 90 [2018-11-28 12:32:34,069 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-11-28 12:32:34,914 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 11 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:32:34,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:32:34,915 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00ea5629-8559-4109-b0cb-29a85947b795/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-11-28 12:32:34,921 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 12:32:35,006 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 12:32:35,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:32:35,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:32:35,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:32:35,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:35,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:35,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:32:35,151 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-11-28 12:32:35,153 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-11-28 12:32:35,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:35,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:35,163 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-11-28 12:32:35,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11-28 12:32:35,165 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:35,166 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:35,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:35,173 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-11-28 12:32:35,320 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:35,321 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:35,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-11-28 12:32:35,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:35,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 12:32:35,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:35,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:35,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:47 [2018-11-28 12:32:35,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:35,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:35,633 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:35,635 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:35,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:35,644 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:87, output treesize:57 [2018-11-28 12:32:35,646 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:35,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:35,662 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:35,664 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:35,674 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-11-28 12:32:35,674 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:56 [2018-11-28 12:32:42,094 WARN L180 SmtUtils]: Spent 898.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-28 12:32:43,359 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 42 [2018-11-28 12:32:43,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:43,366 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:43,367 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-11-28 12:32:43,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:43,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:43,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:43,392 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:43,392 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-11-28 12:32:43,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:43,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:43,416 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-11-28 12:32:43,418 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-11-28 12:32:43,420 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:43,421 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-11-28 12:32:43,421 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:43,426 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:43,433 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:43,452 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:43,455 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-11-28 12:32:43,456 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-11-28 12:32:43,458 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:43,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 12:32:43,459 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:43,463 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:43,467 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:43,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:43,482 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:99, output treesize:122 [2018-11-28 12:32:43,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:43,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:43,710 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:43,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:43,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:43,720 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:51 [2018-11-28 12:32:43,721 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:43,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:43,733 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:43,736 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:43,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:43,743 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:47 [2018-11-28 12:32:55,940 WARN L180 SmtUtils]: Spent 848.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 12:32:57,547 WARN L180 SmtUtils]: Spent 852.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 12:32:57,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:57,555 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:57,556 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:57,557 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:57,558 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-11-28 12:32:57,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:57,590 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:57,591 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:57,592 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:57,593 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:57,594 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:57,594 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-11-28 12:32:57,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:57,619 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:57,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:57,623 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:57,624 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:57,625 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-11-28 12:32:57,627 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-11-28 12:32:57,630 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:57,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 12:32:57,631 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:57,637 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:57,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:57,669 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:57,669 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:57,670 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:57,675 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-11-28 12:32:57,677 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-11-28 12:32:57,678 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:57,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 12:32:57,680 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:57,683 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:57,690 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:57,704 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-11-28 12:32:57,705 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:147, output treesize:163 [2018-11-28 12:32:58,482 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:58,483 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:58,483 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:58,484 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:58,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:58,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:58,490 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:58,490 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 204 treesize of output 201 [2018-11-28 12:32:58,497 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:58,509 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 103 treesize of output 95 [2018-11-28 12:32:58,515 INFO L267 ElimStorePlain]: Start of recursive call 3: 17 dim-0 vars, End of recursive call: 17 dim-0 vars, and 7 xjuncts. [2018-11-28 12:32:58,636 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:58,640 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 82 treesize of output 80 [2018-11-28 12:32:58,641 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 12:32:58,643 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:58,643 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 66 treesize of output 56 [2018-11-28 12:32:58,643 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:58,646 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:58,646 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:58,646 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:58,648 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 88 treesize of output 86 [2018-11-28 12:32:58,649 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:58,650 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:58,650 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 72 treesize of output 62 [2018-11-28 12:32:58,651 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:58,653 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:58,659 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 72 treesize of output 70 [2018-11-28 12:32:58,659 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-28 12:32:58,663 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:58,668 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 88 treesize of output 86 [2018-11-28 12:32:58,669 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-28 12:32:58,673 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:58,679 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 78 treesize of output 76 [2018-11-28 12:32:58,680 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-28 12:32:58,847 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 104 treesize of output 98 [2018-11-28 12:32:58,849 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 12:32:58,851 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:58,852 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 104 treesize of output 94 [2018-11-28 12:32:58,853 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:58,855 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 88 treesize of output 76 [2018-11-28 12:32:58,855 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:58,863 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 98 treesize of output 92 [2018-11-28 12:32:58,865 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 12:32:58,872 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 94 treesize of output 88 [2018-11-28 12:32:58,873 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 12:32:58,875 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 88 treesize of output 76 [2018-11-28 12:32:58,875 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:58,881 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 94 treesize of output 88 [2018-11-28 12:32:58,882 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 12:32:59,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 22 dim-0 vars, and 11 xjuncts. [2018-11-28 12:32:59,377 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 83 treesize of output 71 [2018-11-28 12:32:59,379 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:59,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-11-28 12:32:59,379 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,393 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-11-28 12:32:59,393 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,404 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:59,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 12:32:59,405 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,415 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,418 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 83 treesize of output 71 [2018-11-28 12:32:59,420 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:59,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 12:32:59,420 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,434 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-11-28 12:32:59,435 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 12:32:59,446 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,456 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,459 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 83 treesize of output 71 [2018-11-28 12:32:59,461 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:59,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-11-28 12:32:59,462 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,475 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:59,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 12:32:59,476 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,488 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-11-28 12:32:59,488 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,498 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,501 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 83 treesize of output 71 [2018-11-28 12:32:59,503 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:59,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-11-28 12:32:59,503 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,517 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-11-28 12:32:59,517 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,528 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:59,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 13 treesize of output 9 [2018-11-28 12:32:59,529 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,539 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,542 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 83 treesize of output 71 [2018-11-28 12:32:59,544 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:59,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-11-28 12:32:59,545 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,558 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:59,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 12:32:59,559 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,571 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-11-28 12:32:59,571 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,580 INFO L267 ElimStorePlain]: Start of recursive call 34: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,584 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 83 treesize of output 71 [2018-11-28 12:32:59,586 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-11-28 12:32:59,586 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 12:32:59,600 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,612 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:59,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 12:32:59,613 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,623 INFO L267 ElimStorePlain]: Start of recursive call 38: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,626 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 83 treesize of output 71 [2018-11-28 12:32:59,628 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-11-28 12:32:59,628 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,647 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:59,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 12:32:59,647 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 12:32:59,660 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,670 INFO L267 ElimStorePlain]: Start of recursive call 42: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,673 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 83 treesize of output 71 [2018-11-28 12:32:59,675 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:59,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 12:32:59,675 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,690 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-11-28 12:32:59,690 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 12:32:59,703 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,712 INFO L267 ElimStorePlain]: Start of recursive call 46: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,715 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 83 treesize of output 71 [2018-11-28 12:32:59,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-11-28 12:32:59,717 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 12:32:59,731 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,742 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:59,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 12:32:59,743 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,753 INFO L267 ElimStorePlain]: Start of recursive call 50: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,756 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 83 treesize of output 71 [2018-11-28 12:32:59,758 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:59,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-11-28 12:32:59,758 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,771 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-11-28 12:32:59,772 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,783 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:59,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 12:32:59,784 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,793 INFO L267 ElimStorePlain]: Start of recursive call 54: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,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 83 treesize of output 71 [2018-11-28 12:32:59,798 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-11-28 12:32:59,798 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 12:32:59,812 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,824 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:32:59,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 12:32:59,824 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,834 INFO L267 ElimStorePlain]: Start of recursive call 58: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:59,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 33 dim-0 vars, and 11 xjuncts. [2018-11-28 12:32:59,973 INFO L202 ElimStorePlain]: Needed 61 recursive calls to eliminate 4 variables, input treesize:219, output treesize:529 [2018-11-28 12:33:00,275 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 14 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:33:00,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:33:00,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 54 [2018-11-28 12:33:00,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-28 12:33:00,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-28 12:33:00,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2785, Unknown=19, NotChecked=0, Total=2970 [2018-11-28 12:33:00,291 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 55 states. [2018-11-28 12:33:19,940 WARN L180 SmtUtils]: Spent 3.60 s on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2018-11-28 12:33:24,217 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 178 DAG size of output: 44 [2018-11-28 12:33:28,593 WARN L180 SmtUtils]: Spent 3.98 s on a formula simplification. DAG size of input: 136 DAG size of output: 39 [2018-11-28 12:33:39,958 WARN L180 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 92 DAG size of output: 48 [2018-11-28 12:33:43,870 WARN L180 SmtUtils]: Spent 3.71 s on a formula simplification. DAG size of input: 196 DAG size of output: 52 [2018-11-28 12:33:53,791 WARN L180 SmtUtils]: Spent 3.05 s on a formula simplification. DAG size of input: 100 DAG size of output: 56 [2018-11-28 12:33:57,169 WARN L180 SmtUtils]: Spent 3.17 s on a formula simplification. DAG size of input: 205 DAG size of output: 68 [2018-11-28 12:34:07,664 WARN L180 SmtUtils]: Spent 3.46 s on a formula simplification. DAG size of input: 109 DAG size of output: 65 [2018-11-28 12:34:10,950 WARN L180 SmtUtils]: Spent 3.11 s on a formula simplification. DAG size of input: 212 DAG size of output: 75 [2018-11-28 12:34:11,393 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 104 [2018-11-28 12:34:11,763 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 118 [2018-11-28 12:34:11,967 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 106 [2018-11-28 12:34:12,198 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 108 [2018-11-28 12:34:12,480 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 120 [2018-11-28 12:34:13,112 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 115 [2018-11-28 12:34:14,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:34:14,138 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2018-11-28 12:34:14,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-28 12:34:14,138 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 71 [2018-11-28 12:34:14,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:34:14,139 INFO L225 Difference]: With dead ends: 127 [2018-11-28 12:34:14,139 INFO L226 Difference]: Without dead ends: 127 [2018-11-28 12:34:14,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 47 SyntacticMatches, 11 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2049 ImplicationChecksByTransitivity, 74.4s TimeCoverageRelationStatistics Valid=874, Invalid=7288, Unknown=28, NotChecked=0, Total=8190 [2018-11-28 12:34:14,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-28 12:34:14,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2018-11-28 12:34:14,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-28 12:34:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2018-11-28 12:34:14,143 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 71 [2018-11-28 12:34:14,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:34:14,143 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2018-11-28 12:34:14,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-28 12:34:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2018-11-28 12:34:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-28 12:34:14,143 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:34:14,143 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-11-28 12:34:14,144 INFO L423 AbstractCegarLoop]: === Iteration 19 === [insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-11-28 12:34:14,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:34:14,144 INFO L82 PathProgramCache]: Analyzing trace with hash 246818738, now seen corresponding path program 3 times [2018-11-28 12:34:14,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:34:14,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:34:14,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:34:14,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:34:14,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:34:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:34:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:34:15,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:34:15,443 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00ea5629-8559-4109-b0cb-29a85947b795/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-11-28 12:34:15,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 12:34:15,526 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 12:34:15,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:34:15,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:34:15,653 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-11-28 12:34:15,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 10 treesize of output 9 [2018-11-28 12:34:15,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:34:15,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:34:15,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:34:15,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-28 12:34:15,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:34:15,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:34:15,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:34:15,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 [2018-11-28 12:34:15,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:34:15,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:34:15,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:34:15,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:44 [2018-11-28 12:34:15,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 12:34:15,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 12:34:15,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:34:15,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:34:15,874 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:34:15,875 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:34:15,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:34:15,883 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:48 [2018-11-28 12:34:16,474 WARN L180 SmtUtils]: Spent 540.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 12:34:17,061 WARN L180 SmtUtils]: Spent 544.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 12:34:17,065 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:34:17,066 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:34:17,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 12:34:17,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:34:17,078 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 25 treesize of output 26 [2018-11-28 12:34:17,080 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-11-28 12:34:17,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:34:17,082 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-11-28 12:34:17,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:34:17,086 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:34:17,089 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:34:17,098 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-11-28 12:34:17,098 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:61, output treesize:51 [2018-11-28 12:34:17,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:34:17,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:34:17,308 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:34:17,309 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:34:17,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:34:17,318 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:51 [2018-11-28 12:34:17,319 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:34:17,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:34:17,331 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:34:17,333 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:34:17,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:34:17,340 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:47 [2018-11-28 12:34:20,020 WARN L180 SmtUtils]: Spent 869.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 12:34:20,933 WARN L180 SmtUtils]: Spent 861.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 12:34:20,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:34:20,939 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:34:20,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 12:34:20,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:34:20,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 12:34:20,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:34:20,973 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-11-28 12:34:20,974 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-11-28 12:34:20,976 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:34:20,978 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-11-28 12:34:20,978 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 12:34:20,982 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:34:20,986 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:34:21,005 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:34:21,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 70 [2018-11-28 12:34:21,015 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 60 treesize of output 59 [2018-11-28 12:34:21,017 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:34:21,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-11-28 12:34:21,018 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:34:21,025 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:34:21,040 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:34:21,052 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-11-28 12:34:21,052 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:88, output treesize:90 [2018-11-28 12:34:21,751 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 24 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:34:21,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:34:21,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 30] total 70 [2018-11-28 12:34:21,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-28 12:34:21,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-28 12:34:21,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=4557, Unknown=2, NotChecked=0, Total=4830 [2018-11-28 12:34:21,768 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 70 states. [2018-11-28 12:34:37,621 WARN L180 SmtUtils]: Spent 3.26 s on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2018-11-28 12:34:42,587 WARN L180 SmtUtils]: Spent 4.84 s on a formula simplification. DAG size of input: 159 DAG size of output: 53 [2018-11-28 12:34:46,870 WARN L180 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 116 DAG size of output: 45 [2018-11-28 12:34:58,634 WARN L180 SmtUtils]: Spent 3.56 s on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2018-11-28 12:35:03,161 WARN L180 SmtUtils]: Spent 4.40 s on a formula simplification. DAG size of input: 163 DAG size of output: 58 [2018-11-28 12:35:11,314 WARN L180 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2018-11-28 12:35:15,981 WARN L180 SmtUtils]: Spent 4.54 s on a formula simplification. DAG size of input: 174 DAG size of output: 66 [2018-11-28 12:35:22,218 WARN L180 SmtUtils]: Spent 3.42 s on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2018-11-28 12:35:27,729 WARN L180 SmtUtils]: Spent 5.38 s on a formula simplification. DAG size of input: 183 DAG size of output: 74 [2018-11-28 12:35:30,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:35:30,373 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2018-11-28 12:35:30,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-28 12:35:30,374 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 76 [2018-11-28 12:35:30,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:35:30,374 INFO L225 Difference]: With dead ends: 123 [2018-11-28 12:35:30,374 INFO L226 Difference]: Without dead ends: 123 [2018-11-28 12:35:30,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3633 ImplicationChecksByTransitivity, 56.9s TimeCoverageRelationStatistics Valid=1361, Invalid=11285, Unknown=10, NotChecked=0, Total=12656 [2018-11-28 12:35:30,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-28 12:35:30,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 116. [2018-11-28 12:35:30,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-28 12:35:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2018-11-28 12:35:30,381 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 76 [2018-11-28 12:35:30,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:35:30,381 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2018-11-28 12:35:30,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-28 12:35:30,381 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2018-11-28 12:35:30,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 12:35:30,381 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:35:30,381 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-11-28 12:35:30,382 INFO L423 AbstractCegarLoop]: === Iteration 20 === [insert_listErr3REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION]=== [2018-11-28 12:35:30,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:35:30,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1234657281, now seen corresponding path program 4 times [2018-11-28 12:35:30,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:35:30,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:35:30,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:35:30,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:35:30,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:35:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:35:31,139 WARN L180 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2018-11-28 12:35:31,659 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-11-28 12:35:33,322 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 83 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:35:33,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:35:33,322 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00ea5629-8559-4109-b0cb-29a85947b795/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-11-28 12:35:33,328 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 12:35:33,365 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 12:35:33,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:35:33,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:35:33,440 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-11-28 12:35:33,441 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-11-28 12:35:33,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:35:33,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:35:33,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:35:33,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2018-11-28 12:35:33,508 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-11-28 12:35:33,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:35:33,512 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-11-28 12:35:33,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:35:33,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:35:33,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:35:33,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:16 [2018-11-28 12:35:35,681 WARN L180 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-28 12:35:35,685 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-11-28 12:35:35,687 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-11-28 12:35:35,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:35:35,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:35:35,701 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-11-28 12:35:35,702 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-11-28 12:35:35,702 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:35:35,704 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:35:35,712 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-11-28 12:35:35,712 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-11-28 12:35:37,373 WARN L180 SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 12:35:39,848 WARN L180 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 12:35:39,852 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:35:39,853 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:35:39,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-11-28 12:35:39,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:35:39,866 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-11-28 12:35:39,868 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-11-28 12:35:39,869 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:35:39,870 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-11-28 12:35:39,871 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:35:39,873 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:35:39,876 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:35:39,883 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-11-28 12:35:39,883 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:52 [2018-11-28 12:35:40,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:35:40,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:35:40,559 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:35:40,561 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:35:40,572 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-11-28 12:35:40,572 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:92, output treesize:62 [2018-11-28 12:35:41,560 WARN L180 SmtUtils]: Spent 566.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-28 12:35:41,562 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:35:41,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:35:41,581 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:35:41,583 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:35:41,595 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-11-28 12:35:41,595 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:93, output treesize:69 [2018-11-28 12:35:57,754 WARN L180 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 45 [2018-11-28 12:36:00,966 WARN L180 SmtUtils]: Spent 2.21 s on a formula simplification that was a NOOP. DAG size: 45 [2018-11-28 12:36:00,971 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:00,972 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:00,973 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:00,974 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-11-28 12:36:00,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:01,001 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-11-28 12:36:01,004 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-11-28 12:36:01,006 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:01,007 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-11-28 12:36:01,008 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:01,012 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:01,018 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:01,041 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-11-28 12:36:01,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-28 12:36:01,045 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:01,046 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-11-28 12:36:01,046 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:01,050 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:01,054 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:01,083 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:01,083 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-11-28 12:36:01,085 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-11-28 12:36:01,087 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:01,088 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-11-28 12:36:01,089 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:01,093 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:01,100 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:01,114 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-11-28 12:36:01,114 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:109, output treesize:108 [2018-11-28 12:36:01,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:01,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:01,411 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:01,413 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:01,422 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-11-28 12:36:01,422 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:56 [2018-11-28 12:36:03,892 WARN L180 SmtUtils]: Spent 550.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-28 12:36:03,894 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:36:03,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:36:03,910 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:36:03,912 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:36:03,921 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-11-28 12:36:03,921 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:63 [2018-11-28 12:36:30,075 WARN L180 SmtUtils]: Spent 2.22 s on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 12:36:34,334 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 12:36:34,339 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:34,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:34,341 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:34,342 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:34,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:34,344 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-11-28 12:36:34,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:34,373 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-11-28 12:36:34,375 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-11-28 12:36:34,378 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:34,379 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-11-28 12:36:34,380 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:34,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:34,389 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:34,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:34,416 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-11-28 12:36:34,418 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-11-28 12:36:34,420 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:34,421 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-11-28 12:36:34,421 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:34,426 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:34,434 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:34,452 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:34,454 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:34,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:34,457 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:34,458 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-11-28 12:36:34,461 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-11-28 12:36:34,464 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:34,465 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-11-28 12:36:34,465 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:34,472 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:34,484 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:34,498 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-11-28 12:36:34,498 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:151, output treesize:134 [2018-11-28 12:36:35,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:35,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:35,616 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:35,616 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:36:35,617 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:35,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:35,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:35,619 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:35,620 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 179 [2018-11-28 12:36:35,625 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:36:35,635 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-11-28 12:36:35,639 INFO L267 ElimStorePlain]: Start of recursive call 3: 17 dim-0 vars, End of recursive call: 17 dim-0 vars, and 7 xjuncts. [2018-11-28 12:36:35,716 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:36:35,717 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-11-28 12:36:35,717 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:35,729 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:36:35,743 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-11-28 12:36:35,744 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 12:36:35,749 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:36:35,757 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-11-28 12:36:35,758 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-28 12:36:35,761 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:36:35,763 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-11-28 12:36:35,763 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:35,767 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:36:35,773 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-11-28 12:36:35,774 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-28 12:36:35,776 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:36:35,782 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-11-28 12:36:35,783 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-28 12:36:35,785 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:36:35,786 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:35,807 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-11-28 12:36:35,808 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:35,950 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:36:35,951 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-11-28 12:36:35,952 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:36:35,958 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-11-28 12:36:35,959 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 12:36:35,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, 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-11-28 12:36:35,964 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 12:36:35,970 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-11-28 12:36:35,971 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 12:36:35,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 12:36:35,972 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:36:35,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 12:36:35,974 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:36:35,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11-28 12:36:35,981 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 12:36:36,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 22 dim-0 vars, and 11 xjuncts. [2018-11-28 12:36:36,345 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-11-28 12:36:36,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2018-11-28 12:36:36,347 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,357 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-11-28 12:36:36,357 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,368 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-11-28 12:36:36,368 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,375 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,378 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-11-28 12:36:36,380 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:36:36,380 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-11-28 12:36:36,380 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,391 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-11-28 12:36:36,391 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-28 12:36:36,400 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,407 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,410 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-11-28 12:36:36,411 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:36:36,412 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-11-28 12:36:36,412 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,423 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-11-28 12:36:36,423 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,432 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-11-28 12:36:36,432 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,439 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,443 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-11-28 12:36:36,444 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:36:36,445 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-11-28 12:36:36,445 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,455 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-11-28 12:36:36,456 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-28 12:36:36,465 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,471 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,475 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-11-28 12:36:36,476 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:36:36,477 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-11-28 12:36:36,477 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,488 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-11-28 12:36:36,488 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,499 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-11-28 12:36:36,499 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,507 INFO L267 ElimStorePlain]: Start of recursive call 34: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,511 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-11-28 12:36:36,513 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-11-28 12:36:36,513 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,523 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:36:36,524 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-11-28 12:36:36,524 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,534 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-11-28 12:36:36,534 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,541 INFO L267 ElimStorePlain]: Start of recursive call 38: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,544 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-11-28 12:36:36,546 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:36:36,546 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-11-28 12:36:36,546 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,558 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-11-28 12:36:36,558 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,567 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-11-28 12:36:36,567 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,574 INFO L267 ElimStorePlain]: Start of recursive call 42: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,578 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-11-28 12:36:36,580 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:36:36,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, 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-11-28 12:36:36,581 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,592 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-11-28 12:36:36,592 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 12:36:36,601 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,609 INFO L267 ElimStorePlain]: Start of recursive call 46: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,612 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-11-28 12:36:36,614 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:36:36,614 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-11-28 12:36:36,615 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,626 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-11-28 12:36:36,626 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,635 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-11-28 12:36:36,635 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,642 INFO L267 ElimStorePlain]: Start of recursive call 50: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,645 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-11-28 12:36:36,647 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-11-28 12:36:36,647 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,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 15 treesize of output 5 [2018-11-28 12:36:36,658 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,667 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-11-28 12:36:36,667 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,674 INFO L267 ElimStorePlain]: Start of recursive call 54: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,677 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-11-28 12:36:36,679 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:36:36,680 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-11-28 12:36:36,680 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,691 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-11-28 12:36:36,691 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,700 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-11-28 12:36:36,700 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,711 INFO L267 ElimStorePlain]: Start of recursive call 58: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,801 INFO L202 ElimStorePlain]: Needed 61 recursive calls to eliminate 3 variables, input treesize:190, output treesize:14 [2018-11-28 12:36:36,949 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-11-28 12:36:36,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 12:36:36,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:36:36,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-28 12:36:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 30 proven. 65 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:36:37,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:36:37,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 70 [2018-11-28 12:36:37,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-28 12:36:37,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-28 12:36:37,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=4617, Unknown=43, NotChecked=0, Total=4830 [2018-11-28 12:36:37,129 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand 70 states. [2018-11-28 12:37:26,936 WARN L180 SmtUtils]: Spent 6.34 s on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2018-11-28 12:37:35,256 WARN L180 SmtUtils]: Spent 7.86 s on a formula simplification. DAG size of input: 177 DAG size of output: 67 [2018-11-28 12:37:42,323 WARN L180 SmtUtils]: Spent 6.46 s on a formula simplification. DAG size of input: 128 DAG size of output: 61 [2018-11-28 12:38:13,376 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2018-11-28 12:38:24,588 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2018-11-28 12:38:28,624 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2018-11-28 12:38:33,686 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 113 [2018-11-28 12:38:34,007 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2018-11-28 12:38:34,400 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 142 [2018-11-28 12:38:34,640 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 124 [2018-11-28 12:38:35,296 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 144 [2018-11-28 12:38:35,815 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 123 [2018-11-28 12:38:36,155 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 141 [2018-11-28 12:38:51,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:38:51,758 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2018-11-28 12:38:51,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-28 12:38:51,758 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 78 [2018-11-28 12:38:51,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:38:51,758 INFO L225 Difference]: With dead ends: 128 [2018-11-28 12:38:51,758 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 12:38:51,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3048 ImplicationChecksByTransitivity, 131.5s TimeCoverageRelationStatistics Valid=933, Invalid=13995, Unknown=78, NotChecked=0, Total=15006 [2018-11-28 12:38:51,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 12:38:51,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 12:38:51,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 12:38:51,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 12:38:51,760 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2018-11-28 12:38:51,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:38:51,760 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:38:51,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-28 12:38:51,760 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:38:51,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 12:38:51,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:38:51 BoogieIcfgContainer [2018-11-28 12:38:51,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:38:51,765 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:38:51,765 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:38:51,765 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:38:51,765 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:30:42" (3/4) ... [2018-11-28 12:38:51,768 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 12:38:51,774 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 12:38:51,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure insert_list [2018-11-28 12:38:51,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 12:38:51,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-28 12:38:51,775 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure search_list [2018-11-28 12:38:51,779 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-11-28 12:38:51,779 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 12:38:51,779 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 12:38:51,809 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_00ea5629-8559-4109-b0cb-29a85947b795/bin-2019/uautomizer/witness.graphml [2018-11-28 12:38:51,809 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:38:51,810 INFO L168 Benchmark]: Toolchain (without parser) took 489980.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.0 MB). Free memory was 950.6 MB in the beginning and 801.9 MB in the end (delta: 148.7 MB). Peak memory consumption was 343.8 MB. Max. memory is 11.5 GB. [2018-11-28 12:38:51,810 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:38:51,810 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2018-11-28 12:38:51,811 INFO L168 Benchmark]: Boogie Preprocessor took 38.47 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-11-28 12:38:51,811 INFO L168 Benchmark]: RCFGBuilder took 317.62 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: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:38:51,811 INFO L168 Benchmark]: TraceAbstraction took 489265.63 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 801.9 MB in the end (delta: 269.8 MB). Peak memory consumption was 330.6 MB. Max. memory is 11.5 GB. [2018-11-28 12:38:51,811 INFO L168 Benchmark]: Witness Printer took 44.37 ms. Allocated memory is still 1.2 GB. Free memory was 801.9 MB in the beginning and 801.9 MB in the end (delta: 9.7 kB). Peak memory consumption was 9.7 kB. Max. memory is 11.5 GB. [2018-11-28 12:38:51,812 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 311.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.47 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 317.62 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: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 489265.63 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 801.9 MB in the end (delta: 269.8 MB). Peak memory consumption was 330.6 MB. Max. memory is 11.5 GB. * Witness Printer took 44.37 ms. Allocated memory is still 1.2 GB. Free memory was 801.9 MB in the beginning and 801.9 MB in the end (delta: 9.7 kB). Peak memory consumption was 9.7 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 635]: 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: 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: 633]: 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: 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: 643]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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: 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: 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, 489.2s OverallTime, 20 OverallIterations, 5 TraceHistogramMax, 364.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 964 SDtfs, 4795 SDslu, 5165 SDs, 0 SdLazy, 18697 SolverSat, 1339 SolverUnsat, 87 SolverUnknown, 0 SolverNotchecked, 116.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1420 GetRequests, 564 SyntacticMatches, 69 SemanticMatches, 787 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15867 ImplicationChecksByTransitivity, 361.8s 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.7s SatisfiabilityAnalysisTime, 123.4s InterpolantComputationTime, 1853 NumberOfCodeBlocks, 1849 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1822 ConstructedInterpolants, 115 QuantifiedInterpolants, 3666187 SizeOfPredicates, 233 NumberOfNonLiveVariables, 4301 ConjunctsInSsa, 916 ConjunctsInUnsatCore, 31 InterpolantComputations, 9 PerfectInterpolantSequences, 903/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...