./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef034042979fe1e524a3655a8992190a25335ff0 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 02:21:19,145 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 02:21:19,146 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 02:21:19,152 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 02:21:19,152 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 02:21:19,152 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 02:21:19,153 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 02:21:19,154 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 02:21:19,155 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 02:21:19,155 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 02:21:19,155 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 02:21:19,155 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 02:21:19,156 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 02:21:19,156 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 02:21:19,157 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 02:21:19,157 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 02:21:19,158 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 02:21:19,158 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 02:21:19,159 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 02:21:19,160 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 02:21:19,160 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 02:21:19,161 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 02:21:19,162 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 02:21:19,162 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 02:21:19,162 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 02:21:19,163 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 02:21:19,163 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 02:21:19,163 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 02:21:19,164 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 02:21:19,164 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 02:21:19,164 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 02:21:19,165 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 02:21:19,165 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 02:21:19,165 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 02:21:19,165 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 02:21:19,166 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 02:21:19,166 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-02 02:21:19,173 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 02:21:19,173 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 02:21:19,173 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 02:21:19,174 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 02:21:19,174 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 02:21:19,174 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 02:21:19,174 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 02:21:19,174 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 02:21:19,174 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 02:21:19,174 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 02:21:19,174 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 02:21:19,174 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 02:21:19,174 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 02:21:19,175 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 02:21:19,175 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 02:21:19,175 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 02:21:19,175 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 02:21:19,175 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 02:21:19,175 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 02:21:19,175 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 02:21:19,175 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 02:21:19,175 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 02:21:19,175 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 02:21:19,175 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 02:21:19,175 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 02:21:19,176 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 02:21:19,176 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 02:21:19,176 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 02:21:19,176 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_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ef034042979fe1e524a3655a8992190a25335ff0 [2018-12-02 02:21:19,193 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 02:21:19,200 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 02:21:19,202 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 02:21:19,203 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 02:21:19,203 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 02:21:19,203 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 02:21:19,237 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/data/f761a169b/3fce1cf272334546b741f02130db2119/FLAGa0a65e0fd [2018-12-02 02:21:19,686 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 02:21:19,687 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 02:21:19,693 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/data/f761a169b/3fce1cf272334546b741f02130db2119/FLAGa0a65e0fd [2018-12-02 02:21:19,701 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/data/f761a169b/3fce1cf272334546b741f02130db2119 [2018-12-02 02:21:19,703 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 02:21:19,704 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 02:21:19,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 02:21:19,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 02:21:19,707 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 02:21:19,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:21:19" (1/1) ... [2018-12-02 02:21:19,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a5e146f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:19, skipping insertion in model container [2018-12-02 02:21:19,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:21:19" (1/1) ... [2018-12-02 02:21:19,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 02:21:19,733 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 02:21:19,885 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:21:19,925 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 02:21:19,951 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:21:19,973 INFO L195 MainTranslator]: Completed translation [2018-12-02 02:21:19,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:19 WrapperNode [2018-12-02 02:21:19,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 02:21:19,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 02:21:19,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 02:21:19,974 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 02:21:19,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:19" (1/1) ... [2018-12-02 02:21:19,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:19" (1/1) ... [2018-12-02 02:21:19,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:19" (1/1) ... [2018-12-02 02:21:19,990 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:19" (1/1) ... [2018-12-02 02:21:19,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:19" (1/1) ... [2018-12-02 02:21:20,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:19" (1/1) ... [2018-12-02 02:21:20,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:19" (1/1) ... [2018-12-02 02:21:20,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 02:21:20,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 02:21:20,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 02:21:20,006 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 02:21:20,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 02:21:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 02:21:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 02:21:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-02 02:21:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-02 02:21:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 02:21:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-02 02:21:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-12-02 02:21:20,037 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-12-02 02:21:20,037 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-12-02 02:21:20,037 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-12-02 02:21:20,037 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 02:21:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-02 02:21:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-02 02:21:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-02 02:21:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-02 02:21:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-02 02:21:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-02 02:21:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-02 02:21:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-02 02:21:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-02 02:21:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-02 02:21:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-02 02:21:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-02 02:21:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-02 02:21:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-02 02:21:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-02 02:21:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-02 02:21:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-02 02:21:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-02 02:21:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-02 02:21:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-02 02:21:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-02 02:21:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-02 02:21:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-02 02:21:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-02 02:21:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-02 02:21:20,039 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-02 02:21:20,039 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-02 02:21:20,039 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-02 02:21:20,039 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-02 02:21:20,039 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-02 02:21:20,039 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-02 02:21:20,039 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-02 02:21:20,039 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-02 02:21:20,039 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-02 02:21:20,039 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-02 02:21:20,039 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-02 02:21:20,039 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-02 02:21:20,039 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-02 02:21:20,039 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-02 02:21:20,039 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-02 02:21:20,039 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-02 02:21:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-02 02:21:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-02 02:21:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-02 02:21:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-02 02:21:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-02 02:21:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-02 02:21:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-02 02:21:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-02 02:21:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-02 02:21:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-02 02:21:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-02 02:21:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-02 02:21:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-02 02:21:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-02 02:21:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-02 02:21:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-02 02:21:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-02 02:21:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-02 02:21:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-02 02:21:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-02 02:21:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-02 02:21:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-02 02:21:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-02 02:21:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-02 02:21:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-02 02:21:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-02 02:21:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-02 02:21:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-02 02:21:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-02 02:21:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-02 02:21:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-02 02:21:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-02 02:21:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-02 02:21:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-02 02:21:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-02 02:21:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-02 02:21:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-02 02:21:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-02 02:21:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-02 02:21:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-02 02:21:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-02 02:21:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-02 02:21:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-02 02:21:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-02 02:21:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-02 02:21:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-02 02:21:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-02 02:21:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-02 02:21:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-02 02:21:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-02 02:21:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-02 02:21:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-02 02:21:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-02 02:21:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-02 02:21:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-02 02:21:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-02 02:21:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-02 02:21:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-02 02:21:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-02 02:21:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-02 02:21:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-02 02:21:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-02 02:21:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-02 02:21:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-02 02:21:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-02 02:21:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 02:21:20,044 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-02 02:21:20,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 02:21:20,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 02:21:20,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 02:21:20,044 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-12-02 02:21:20,044 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-12-02 02:21:20,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 02:21:20,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 02:21:20,044 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-12-02 02:21:20,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 02:21:20,044 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-12-02 02:21:20,044 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 02:21:20,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 02:21:20,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 02:21:20,296 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 02:21:20,297 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-02 02:21:20,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:21:20 BoogieIcfgContainer [2018-12-02 02:21:20,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 02:21:20,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 02:21:20,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 02:21:20,300 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 02:21:20,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:21:19" (1/3) ... [2018-12-02 02:21:20,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f679b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:21:20, skipping insertion in model container [2018-12-02 02:21:20,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:21:19" (2/3) ... [2018-12-02 02:21:20,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f679b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:21:20, skipping insertion in model container [2018-12-02 02:21:20,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:21:20" (3/3) ... [2018-12-02 02:21:20,303 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 02:21:20,309 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 02:21:20,315 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-12-02 02:21:20,326 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2018-12-02 02:21:20,339 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 02:21:20,340 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 02:21:20,340 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 02:21:20,340 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 02:21:20,340 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 02:21:20,340 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 02:21:20,340 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 02:21:20,340 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 02:21:20,340 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 02:21:20,349 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-12-02 02:21:20,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 02:21:20,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:21:20,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:21:20,356 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:21:20,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:21:20,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1323720086, now seen corresponding path program 1 times [2018-12-02 02:21:20,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:21:20,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:21:20,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:20,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:20,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:20,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:21:20,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:21:20,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 02:21:20,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:21:20,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:21:20,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:21:20,486 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2018-12-02 02:21:20,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:21:20,529 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-12-02 02:21:20,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:21:20,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-02 02:21:20,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:21:20,536 INFO L225 Difference]: With dead ends: 84 [2018-12-02 02:21:20,536 INFO L226 Difference]: Without dead ends: 77 [2018-12-02 02:21:20,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:21:20,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-02 02:21:20,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-02 02:21:20,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-02 02:21:20,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-12-02 02:21:20,560 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 13 [2018-12-02 02:21:20,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:21:20,561 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-12-02 02:21:20,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:21:20,561 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-12-02 02:21:20,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 02:21:20,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:21:20,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:21:20,561 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:21:20,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:21:20,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1323720085, now seen corresponding path program 1 times [2018-12-02 02:21:20,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:21:20,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:21:20,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:20,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:20,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:21:20,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:21:20,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 02:21:20,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:21:20,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:21:20,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:21:20,611 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 3 states. [2018-12-02 02:21:20,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:21:20,636 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-12-02 02:21:20,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:21:20,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-02 02:21:20,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:21:20,637 INFO L225 Difference]: With dead ends: 75 [2018-12-02 02:21:20,637 INFO L226 Difference]: Without dead ends: 75 [2018-12-02 02:21:20,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:21:20,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-02 02:21:20,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-02 02:21:20,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 02:21:20,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-12-02 02:21:20,643 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 13 [2018-12-02 02:21:20,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:21:20,644 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-12-02 02:21:20,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:21:20,644 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-12-02 02:21:20,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 02:21:20,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:21:20,645 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:21:20,645 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:21:20,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:21:20,645 INFO L82 PathProgramCache]: Analyzing trace with hash 303614154, now seen corresponding path program 1 times [2018-12-02 02:21:20,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:21:20,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:21:20,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:20,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:20,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:21:20,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:21:20,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:21:20,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:21:20,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:21:20,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:21:20,688 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2018-12-02 02:21:20,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:21:20,730 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2018-12-02 02:21:20,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:21:20,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-02 02:21:20,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:21:20,732 INFO L225 Difference]: With dead ends: 86 [2018-12-02 02:21:20,732 INFO L226 Difference]: Without dead ends: 83 [2018-12-02 02:21:20,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:21:20,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-02 02:21:20,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2018-12-02 02:21:20,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-02 02:21:20,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-12-02 02:21:20,740 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 18 [2018-12-02 02:21:20,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:21:20,740 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-12-02 02:21:20,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:21:20,740 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-12-02 02:21:20,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 02:21:20,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:21:20,741 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:21:20,741 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:21:20,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:21:20,741 INFO L82 PathProgramCache]: Analyzing trace with hash -677829022, now seen corresponding path program 1 times [2018-12-02 02:21:20,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:21:20,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:21:20,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:20,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:20,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:20,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:21:20,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:21:20,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:21:20,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:21:20,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:21:20,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:21:20,782 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 6 states. [2018-12-02 02:21:20,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:21:20,859 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-12-02 02:21:20,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:21:20,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-02 02:21:20,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:21:20,862 INFO L225 Difference]: With dead ends: 76 [2018-12-02 02:21:20,862 INFO L226 Difference]: Without dead ends: 76 [2018-12-02 02:21:20,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:21:20,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-02 02:21:20,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-12-02 02:21:20,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 02:21:20,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-12-02 02:21:20,867 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 19 [2018-12-02 02:21:20,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:21:20,867 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-12-02 02:21:20,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:21:20,868 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-12-02 02:21:20,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 02:21:20,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:21:20,868 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:21:20,869 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:21:20,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:21:20,869 INFO L82 PathProgramCache]: Analyzing trace with hash -677829021, now seen corresponding path program 1 times [2018-12-02 02:21:20,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:21:20,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:21:20,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:20,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:20,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:20,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:21:20,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:21:20,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:21:20,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:21:20,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:21:20,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:21:20,928 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 6 states. [2018-12-02 02:21:20,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:21:20,991 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-12-02 02:21:20,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:21:20,991 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-02 02:21:20,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:21:20,992 INFO L225 Difference]: With dead ends: 75 [2018-12-02 02:21:20,992 INFO L226 Difference]: Without dead ends: 75 [2018-12-02 02:21:20,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:21:20,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-02 02:21:20,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-12-02 02:21:20,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-02 02:21:20,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-12-02 02:21:20,997 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 19 [2018-12-02 02:21:20,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:21:20,997 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-12-02 02:21:20,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:21:20,998 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-12-02 02:21:20,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 02:21:20,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:21:20,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:21:20,998 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:21:20,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:21:20,999 INFO L82 PathProgramCache]: Analyzing trace with hash 649435046, now seen corresponding path program 1 times [2018-12-02 02:21:20,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:21:20,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:21:20,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:21,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:21,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:21,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:21:21,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:21:21,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 02:21:21,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 02:21:21,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 02:21:21,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 02:21:21,089 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 12 states. [2018-12-02 02:21:21,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:21:21,275 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-12-02 02:21:21,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 02:21:21,275 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-12-02 02:21:21,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:21:21,276 INFO L225 Difference]: With dead ends: 80 [2018-12-02 02:21:21,276 INFO L226 Difference]: Without dead ends: 80 [2018-12-02 02:21:21,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-02 02:21:21,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-02 02:21:21,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-12-02 02:21:21,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-02 02:21:21,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-12-02 02:21:21,281 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 31 [2018-12-02 02:21:21,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:21:21,281 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-12-02 02:21:21,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 02:21:21,281 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-12-02 02:21:21,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 02:21:21,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:21:21,282 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:21:21,282 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:21:21,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:21:21,282 INFO L82 PathProgramCache]: Analyzing trace with hash 649435047, now seen corresponding path program 1 times [2018-12-02 02:21:21,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:21:21,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:21:21,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:21,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:21,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:21,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:21:21,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:21:21,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:21:21,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:21,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:21:21,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:21:21,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:21:21,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-02 02:21:21,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:21:21,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:21:21,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:21:21,389 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 6 states. [2018-12-02 02:21:21,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:21:21,421 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-12-02 02:21:21,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:21:21,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-12-02 02:21:21,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:21:21,422 INFO L225 Difference]: With dead ends: 91 [2018-12-02 02:21:21,422 INFO L226 Difference]: Without dead ends: 88 [2018-12-02 02:21:21,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:21:21,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-02 02:21:21,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2018-12-02 02:21:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-02 02:21:21,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-12-02 02:21:21,425 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 31 [2018-12-02 02:21:21,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:21:21,425 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-12-02 02:21:21,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:21:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-12-02 02:21:21,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 02:21:21,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:21:21,426 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:21:21,427 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:21:21,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:21:21,427 INFO L82 PathProgramCache]: Analyzing trace with hash 40947275, now seen corresponding path program 2 times [2018-12-02 02:21:21,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:21:21,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:21:21,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:21,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:21,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:21,547 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 02:21:21,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:21:21,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 02:21:21,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 02:21:21,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 02:21:21,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:21:21,548 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 13 states. [2018-12-02 02:21:21,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:21:21,717 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-12-02 02:21:21,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 02:21:21,718 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-12-02 02:21:21,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:21:21,719 INFO L225 Difference]: With dead ends: 86 [2018-12-02 02:21:21,719 INFO L226 Difference]: Without dead ends: 86 [2018-12-02 02:21:21,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-12-02 02:21:21,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-02 02:21:21,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2018-12-02 02:21:21,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-02 02:21:21,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-12-02 02:21:21,724 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 44 [2018-12-02 02:21:21,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:21:21,724 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-12-02 02:21:21,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 02:21:21,724 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-12-02 02:21:21,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 02:21:21,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:21:21,725 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:21:21,725 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:21:21,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:21:21,726 INFO L82 PathProgramCache]: Analyzing trace with hash -2009121221, now seen corresponding path program 1 times [2018-12-02 02:21:21,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:21:21,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:21:21,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:21,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:21:21,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:21,819 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 02:21:21,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:21:21,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 02:21:21,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 02:21:21,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 02:21:21,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 02:21:21,820 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 9 states. [2018-12-02 02:21:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:21:21,939 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-12-02 02:21:21,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 02:21:21,939 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-12-02 02:21:21,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:21:21,939 INFO L225 Difference]: With dead ends: 94 [2018-12-02 02:21:21,940 INFO L226 Difference]: Without dead ends: 94 [2018-12-02 02:21:21,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-02 02:21:21,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-02 02:21:21,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2018-12-02 02:21:21,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-02 02:21:21,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-12-02 02:21:21,943 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 46 [2018-12-02 02:21:21,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:21:21,943 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-12-02 02:21:21,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 02:21:21,943 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-12-02 02:21:21,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 02:21:21,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:21:21,944 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:21:21,944 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:21:21,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:21:21,944 INFO L82 PathProgramCache]: Analyzing trace with hash -2009121220, now seen corresponding path program 1 times [2018-12-02 02:21:21,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:21:21,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:21:21,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:21,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:21,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 02:21:21,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:21:21,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:21:21,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:21:21,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:21:21,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:21:21,977 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 4 states. [2018-12-02 02:21:21,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:21:21,996 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2018-12-02 02:21:21,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:21:21,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-02 02:21:21,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:21:21,997 INFO L225 Difference]: With dead ends: 92 [2018-12-02 02:21:21,997 INFO L226 Difference]: Without dead ends: 92 [2018-12-02 02:21:21,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:21:21,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-02 02:21:22,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2018-12-02 02:21:22,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-02 02:21:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2018-12-02 02:21:22,001 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 46 [2018-12-02 02:21:22,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:21:22,002 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2018-12-02 02:21:22,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:21:22,002 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2018-12-02 02:21:22,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 02:21:22,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:21:22,003 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:21:22,003 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:21:22,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:21:22,003 INFO L82 PathProgramCache]: Analyzing trace with hash 91149112, now seen corresponding path program 1 times [2018-12-02 02:21:22,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:21:22,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:21:22,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:22,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:22,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:22,038 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 02:21:22,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:21:22,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:21:22,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:21:22,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:21:22,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:21:22,039 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 5 states. [2018-12-02 02:21:22,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:21:22,059 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2018-12-02 02:21:22,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:21:22,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-02 02:21:22,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:21:22,060 INFO L225 Difference]: With dead ends: 97 [2018-12-02 02:21:22,060 INFO L226 Difference]: Without dead ends: 97 [2018-12-02 02:21:22,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:21:22,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-02 02:21:22,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2018-12-02 02:21:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-02 02:21:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2018-12-02 02:21:22,063 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 47 [2018-12-02 02:21:22,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:21:22,063 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2018-12-02 02:21:22,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:21:22,063 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2018-12-02 02:21:22,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 02:21:22,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:21:22,064 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:21:22,064 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:21:22,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:21:22,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1790381074, now seen corresponding path program 1 times [2018-12-02 02:21:22,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:21:22,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:21:22,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:22,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:22,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:22,141 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 02:21:22,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:21:22,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 02:21:22,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 02:21:22,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 02:21:22,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 02:21:22,142 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 12 states. [2018-12-02 02:21:22,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:21:22,296 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2018-12-02 02:21:22,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 02:21:22,296 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-12-02 02:21:22,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:21:22,296 INFO L225 Difference]: With dead ends: 97 [2018-12-02 02:21:22,296 INFO L226 Difference]: Without dead ends: 97 [2018-12-02 02:21:22,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-02 02:21:22,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-02 02:21:22,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-12-02 02:21:22,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-02 02:21:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-12-02 02:21:22,298 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 54 [2018-12-02 02:21:22,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:21:22,299 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-12-02 02:21:22,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 02:21:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-12-02 02:21:22,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 02:21:22,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:21:22,299 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:21:22,300 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:21:22,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:21:22,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1790381075, now seen corresponding path program 1 times [2018-12-02 02:21:22,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:21:22,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:21:22,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:22,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:22,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:22,326 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 02:21:22,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:21:22,327 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:21:22,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:22,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:21:22,378 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 02:21:22,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:21:22,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-02 02:21:22,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:21:22,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:21:22,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:21:22,394 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 7 states. [2018-12-02 02:21:22,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:21:22,435 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2018-12-02 02:21:22,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:21:22,435 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-12-02 02:21:22,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:21:22,436 INFO L225 Difference]: With dead ends: 108 [2018-12-02 02:21:22,436 INFO L226 Difference]: Without dead ends: 108 [2018-12-02 02:21:22,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-02 02:21:22,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-02 02:21:22,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2018-12-02 02:21:22,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-02 02:21:22,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2018-12-02 02:21:22,439 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 54 [2018-12-02 02:21:22,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:21:22,439 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2018-12-02 02:21:22,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:21:22,439 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2018-12-02 02:21:22,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 02:21:22,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:21:22,440 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:21:22,440 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:21:22,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:21:22,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1855516484, now seen corresponding path program 1 times [2018-12-02 02:21:22,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:21:22,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:21:22,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:22,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:22,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:22,814 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 02:21:22,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:21:22,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:21:22,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:22,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:21:22,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 02:21:22,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:22,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:22,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 02:21:23,664 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-02 02:21:24,430 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-02 02:21:24,954 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-02 02:21:24,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 02:21:24,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:24,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:21:24,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2018-12-02 02:21:24,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 02:21:24,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 02:21:24,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:24,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:24,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:24,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-12-02 02:21:25,027 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 11 treesize of output 9 [2018-12-02 02:21:25,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 9 treesize of output 5 [2018-12-02 02:21:25,029 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:21:25,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:21:25,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:21:25,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-12-02 02:21:25,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-12-02 02:21:25,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:21:25,129 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 18 [2018-12-02 02:21:25,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:25,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:25,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:21:25,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:20 [2018-12-02 02:21:25,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 02:21:25,192 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 02:21:25,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 02:21:25,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:25,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:25,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:25,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:5 [2018-12-02 02:21:25,223 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 02:21:25,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:21:25,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 31 [2018-12-02 02:21:25,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-02 02:21:25,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-02 02:21:25,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=909, Unknown=5, NotChecked=0, Total=992 [2018-12-02 02:21:25,239 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand 32 states. [2018-12-02 02:21:25,906 WARN L180 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 22 [2018-12-02 02:21:26,461 WARN L180 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2018-12-02 02:21:27,065 WARN L180 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2018-12-02 02:21:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:21:27,958 INFO L93 Difference]: Finished difference Result 166 states and 189 transitions. [2018-12-02 02:21:27,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-02 02:21:27,959 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 55 [2018-12-02 02:21:27,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:21:27,960 INFO L225 Difference]: With dead ends: 166 [2018-12-02 02:21:27,960 INFO L226 Difference]: Without dead ends: 166 [2018-12-02 02:21:27,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 44 SyntacticMatches, 10 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=299, Invalid=2558, Unknown=5, NotChecked=0, Total=2862 [2018-12-02 02:21:27,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-02 02:21:27,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 117. [2018-12-02 02:21:27,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-02 02:21:27,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2018-12-02 02:21:27,965 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 55 [2018-12-02 02:21:27,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:21:27,966 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2018-12-02 02:21:27,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-02 02:21:27,966 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2018-12-02 02:21:27,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 02:21:27,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:21:27,966 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:21:27,966 INFO L423 AbstractCegarLoop]: === Iteration 15 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:21:27,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:21:27,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1855516485, now seen corresponding path program 1 times [2018-12-02 02:21:27,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:21:27,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:21:27,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:27,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:27,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:28,386 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 02:21:28,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:21:28,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:21:28,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:28,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:21:28,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 02:21:28,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:28,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 02:21:28,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:28,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:28,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 02:21:29,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:21:29,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:21:29,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 02:21:29,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:29,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 02:21:29,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:29,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:21:29,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2018-12-02 02:21:29,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 02:21:29,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 02:21:29,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:29,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:29,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 02:21:29,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 02:21:29,878 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:29,879 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:29,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:21:29,886 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:42 [2018-12-02 02:21:30,109 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 22 treesize of output 18 [2018-12-02 02:21:30,110 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 18 treesize of output 10 [2018-12-02 02:21:30,111 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:21:30,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:21:30,123 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 9 treesize of output 7 [2018-12-02 02:21:30,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 02:21:30,125 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:30,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:30,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 02:21:30,132 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:48, output treesize:21 [2018-12-02 02:21:30,265 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 37 treesize of output 30 [2018-12-02 02:21:30,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:21:30,269 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 30 treesize of output 28 [2018-12-02 02:21:30,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:30,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:30,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-02 02:21:30,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:21:30,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 02:21:30,307 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:30,310 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:30,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 02:21:30,322 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:86, output treesize:56 [2018-12-02 02:21:30,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-12-02 02:21:30,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-12-02 02:21:30,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:30,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:30,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 02:21:30,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-02 02:21:30,470 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:30,471 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:30,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:21:30,476 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:60, output treesize:18 [2018-12-02 02:21:30,550 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 02:21:30,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:21:30,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 43 [2018-12-02 02:21:30,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-02 02:21:30,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-02 02:21:30,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1775, Unknown=3, NotChecked=0, Total=1892 [2018-12-02 02:21:30,566 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand 44 states. [2018-12-02 02:21:33,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:21:33,190 INFO L93 Difference]: Finished difference Result 206 states and 236 transitions. [2018-12-02 02:21:33,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-02 02:21:33,190 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 55 [2018-12-02 02:21:33,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:21:33,191 INFO L225 Difference]: With dead ends: 206 [2018-12-02 02:21:33,191 INFO L226 Difference]: Without dead ends: 206 [2018-12-02 02:21:33,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=332, Invalid=3697, Unknown=3, NotChecked=0, Total=4032 [2018-12-02 02:21:33,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-02 02:21:33,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 131. [2018-12-02 02:21:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-02 02:21:33,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 155 transitions. [2018-12-02 02:21:33,195 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 155 transitions. Word has length 55 [2018-12-02 02:21:33,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:21:33,195 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 155 transitions. [2018-12-02 02:21:33,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-02 02:21:33,195 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 155 transitions. [2018-12-02 02:21:33,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 02:21:33,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:21:33,196 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:21:33,196 INFO L423 AbstractCegarLoop]: === Iteration 16 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:21:33,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:21:33,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1464096766, now seen corresponding path program 2 times [2018-12-02 02:21:33,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:21:33,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:21:33,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:33,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:33,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:33,222 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 02:21:33,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:21:33,222 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:21:33,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 02:21:33,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 02:21:33,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 02:21:33,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:21:33,260 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 02:21:33,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:21:33,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-02 02:21:33,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:21:33,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:21:33,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:21:33,286 INFO L87 Difference]: Start difference. First operand 131 states and 155 transitions. Second operand 7 states. [2018-12-02 02:21:33,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:21:33,322 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2018-12-02 02:21:33,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:21:33,322 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2018-12-02 02:21:33,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:21:33,322 INFO L225 Difference]: With dead ends: 112 [2018-12-02 02:21:33,322 INFO L226 Difference]: Without dead ends: 112 [2018-12-02 02:21:33,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-02 02:21:33,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-02 02:21:33,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-02 02:21:33,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-02 02:21:33,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2018-12-02 02:21:33,325 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 58 [2018-12-02 02:21:33,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:21:33,325 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2018-12-02 02:21:33,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:21:33,325 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2018-12-02 02:21:33,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 02:21:33,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:21:33,325 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:21:33,326 INFO L423 AbstractCegarLoop]: === Iteration 17 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:21:33,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:21:33,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1111258489, now seen corresponding path program 2 times [2018-12-02 02:21:33,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:21:33,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:21:33,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:33,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:21:33,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:33,356 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 02:21:33,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:21:33,356 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:21:33,362 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 02:21:33,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 02:21:33,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 02:21:33,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:21:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 02:21:33,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:21:33,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-12-02 02:21:33,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 02:21:33,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 02:21:33,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-02 02:21:33,429 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand 9 states. [2018-12-02 02:21:33,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:21:33,496 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2018-12-02 02:21:33,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 02:21:33,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2018-12-02 02:21:33,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:21:33,497 INFO L225 Difference]: With dead ends: 110 [2018-12-02 02:21:33,497 INFO L226 Difference]: Without dead ends: 104 [2018-12-02 02:21:33,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:21:33,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-02 02:21:33,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-02 02:21:33,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 02:21:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-12-02 02:21:33,500 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 62 [2018-12-02 02:21:33,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:21:33,500 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-12-02 02:21:33,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 02:21:33,500 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-12-02 02:21:33,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 02:21:33,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:21:33,501 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:21:33,501 INFO L423 AbstractCegarLoop]: === Iteration 18 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:21:33,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:21:33,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1030898547, now seen corresponding path program 1 times [2018-12-02 02:21:33,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:21:33,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:21:33,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:33,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:21:33,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:33,643 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 02:21:33,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:21:33,644 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:21:33,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:33,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:21:33,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 02:21:33,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:33,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:33,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 02:21:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 02:21:33,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:21:33,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 25 [2018-12-02 02:21:33,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-02 02:21:33,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-02 02:21:33,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-12-02 02:21:33,894 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 26 states. [2018-12-02 02:21:34,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:21:34,121 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2018-12-02 02:21:34,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 02:21:34,122 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 65 [2018-12-02 02:21:34,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:21:34,122 INFO L225 Difference]: With dead ends: 109 [2018-12-02 02:21:34,122 INFO L226 Difference]: Without dead ends: 109 [2018-12-02 02:21:34,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2018-12-02 02:21:34,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-02 02:21:34,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2018-12-02 02:21:34,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 02:21:34,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2018-12-02 02:21:34,125 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 65 [2018-12-02 02:21:34,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:21:34,125 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2018-12-02 02:21:34,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-02 02:21:34,125 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2018-12-02 02:21:34,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 02:21:34,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:21:34,126 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:21:34,126 INFO L423 AbstractCegarLoop]: === Iteration 19 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:21:34,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:21:34,126 INFO L82 PathProgramCache]: Analyzing trace with hash 295194122, now seen corresponding path program 3 times [2018-12-02 02:21:34,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:21:34,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:21:34,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:34,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:34,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:34,163 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 02:21:34,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:21:34,163 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:21:34,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 02:21:34,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 02:21:34,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 02:21:34,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:21:34,251 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 02:21:34,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:21:34,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2018-12-02 02:21:34,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 02:21:34,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 02:21:34,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-12-02 02:21:34,267 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 12 states. [2018-12-02 02:21:34,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:21:34,344 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2018-12-02 02:21:34,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 02:21:34,345 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-12-02 02:21:34,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:21:34,345 INFO L225 Difference]: With dead ends: 96 [2018-12-02 02:21:34,345 INFO L226 Difference]: Without dead ends: 96 [2018-12-02 02:21:34,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-12-02 02:21:34,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-02 02:21:34,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-02 02:21:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-02 02:21:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-12-02 02:21:34,349 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 66 [2018-12-02 02:21:34,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:21:34,349 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-12-02 02:21:34,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 02:21:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-12-02 02:21:34,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 02:21:34,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:21:34,350 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:21:34,350 INFO L423 AbstractCegarLoop]: === Iteration 20 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:21:34,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:21:34,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1814159334, now seen corresponding path program 1 times [2018-12-02 02:21:34,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:21:34,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:21:34,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:34,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:21:34,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:34,383 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-02 02:21:34,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:21:34,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:21:34,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:21:34,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:21:34,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:21:34,384 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 5 states. [2018-12-02 02:21:34,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:21:34,407 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-12-02 02:21:34,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:21:34,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-02 02:21:34,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:21:34,408 INFO L225 Difference]: With dead ends: 102 [2018-12-02 02:21:34,408 INFO L226 Difference]: Without dead ends: 102 [2018-12-02 02:21:34,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:21:34,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-02 02:21:34,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-02 02:21:34,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-02 02:21:34,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2018-12-02 02:21:34,410 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 68 [2018-12-02 02:21:34,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:21:34,411 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2018-12-02 02:21:34,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:21:34,411 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-12-02 02:21:34,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-02 02:21:34,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:21:34,411 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:21:34,411 INFO L423 AbstractCegarLoop]: === Iteration 21 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:21:34,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:21:34,412 INFO L82 PathProgramCache]: Analyzing trace with hash -2068123706, now seen corresponding path program 1 times [2018-12-02 02:21:34,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:21:34,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:21:34,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:34,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:34,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 02:21:35,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:21:35,023 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:21:35,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:35,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:21:35,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 02:21:35,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:35,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:35,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 02:21:35,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:21:35,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:21:35,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 02:21:35,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:35,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:35,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-02 02:21:35,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 02:21:35,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 02:21:35,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:35,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:35,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:35,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2018-12-02 02:21:36,180 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (and (<= sll_update_at_~head.offset |c_sll_update_at_#in~head.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset))) |c_#memory_$Pointer$.base|))) is different from true [2018-12-02 02:21:36,184 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 26 treesize of output 21 [2018-12-02 02:21:36,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:21:36,187 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 21 treesize of output 17 [2018-12-02 02:21:36,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:36,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:36,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:36,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:10 [2018-12-02 02:21:38,364 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-02 02:21:38,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-12-02 02:21:38,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 24 treesize of output 1 [2018-12-02 02:21:38,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:38,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:38,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:38,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:22 [2018-12-02 02:21:38,601 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 31 treesize of output 25 [2018-12-02 02:21:38,602 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 25 treesize of output 10 [2018-12-02 02:21:38,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:38,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:38,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:38,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:5 [2018-12-02 02:21:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 2 not checked. [2018-12-02 02:21:38,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:21:38,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 29] total 62 [2018-12-02 02:21:38,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-02 02:21:38,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-02 02:21:38,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=3632, Unknown=1, NotChecked=120, Total=3906 [2018-12-02 02:21:38,668 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 63 states. [2018-12-02 02:21:40,404 WARN L180 SmtUtils]: Spent 661.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-12-02 02:21:42,417 WARN L180 SmtUtils]: Spent 1.71 s on a formula simplification that was a NOOP. DAG size: 41 [2018-12-02 02:21:43,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:21:43,946 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2018-12-02 02:21:43,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-02 02:21:43,946 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 79 [2018-12-02 02:21:43,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:21:43,947 INFO L225 Difference]: With dead ends: 122 [2018-12-02 02:21:43,947 INFO L226 Difference]: Without dead ends: 122 [2018-12-02 02:21:43,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 94 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1584 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=506, Invalid=8427, Unknown=1, NotChecked=186, Total=9120 [2018-12-02 02:21:43,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-02 02:21:43,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 106. [2018-12-02 02:21:43,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-02 02:21:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2018-12-02 02:21:43,950 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 79 [2018-12-02 02:21:43,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:21:43,950 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-12-02 02:21:43,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-02 02:21:43,950 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2018-12-02 02:21:43,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-02 02:21:43,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:21:43,951 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:21:43,951 INFO L423 AbstractCegarLoop]: === Iteration 22 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:21:43,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:21:43,952 INFO L82 PathProgramCache]: Analyzing trace with hash -2068123705, now seen corresponding path program 1 times [2018-12-02 02:21:43,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:21:43,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:21:43,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:43,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:43,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:21:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:45,099 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2018-12-02 02:21:46,068 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 02:21:46,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:21:46,068 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:21:46,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:21:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:21:46,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:21:46,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 02:21:46,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:46,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:46,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 02:21:46,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 02:21:46,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:46,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:46,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-02 02:21:46,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:21:46,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:21:46,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 02:21:46,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:46,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:46,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:16 [2018-12-02 02:21:46,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 02:21:46,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 02:21:46,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:46,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:46,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:46,407 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-12-02 02:21:46,580 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 10 treesize of output 8 [2018-12-02 02:21:46,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2018-12-02 02:21:46,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:46,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:46,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:21:46,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:9 [2018-12-02 02:21:46,662 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 15 treesize of output 12 [2018-12-02 02:21:46,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-02 02:21:46,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:46,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:46,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 02:21:46,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:24 [2018-12-02 02:21:57,547 WARN L180 SmtUtils]: Spent 650.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-02 02:21:57,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-12-02 02:21:57,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:21:57,558 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 21 treesize of output 17 [2018-12-02 02:21:57,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:57,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:57,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:21:57,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-12-02 02:21:57,604 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 10 treesize of output 8 [2018-12-02 02:21:57,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2018-12-02 02:21:57,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:57,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:57,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:21:57,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:12 [2018-12-02 02:21:59,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:21:59,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 124 [2018-12-02 02:21:59,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 36 treesize of output 1 [2018-12-02 02:21:59,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:59,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:59,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 75 [2018-12-02 02:21:59,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2018-12-02 02:21:59,438 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:21:59,442 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:21:59,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 02:21:59,451 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:155, output treesize:62 [2018-12-02 02:22:06,243 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 39 treesize of output 33 [2018-12-02 02:22:06,245 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 02:22:06,245 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 33 treesize of output 25 [2018-12-02 02:22:06,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:22:06,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:22:06,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-12-02 02:22:06,266 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 02:22:06,266 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 26 treesize of output 18 [2018-12-02 02:22:06,266 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:22:06,270 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:22:06,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:22:06,279 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:75, output treesize:25 [2018-12-02 02:22:08,960 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 18 refuted. 2 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 02:22:08,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:22:08,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 58 [2018-12-02 02:22:08,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-02 02:22:08,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-02 02:22:08,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=3248, Unknown=17, NotChecked=0, Total=3422 [2018-12-02 02:22:08,976 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 59 states. [2018-12-02 02:22:44,273 WARN L180 SmtUtils]: Spent 3.32 s on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2018-12-02 02:23:13,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:23:13,693 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-12-02 02:23:13,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-02 02:23:13,694 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 79 [2018-12-02 02:23:13,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:23:13,695 INFO L225 Difference]: With dead ends: 123 [2018-12-02 02:23:13,695 INFO L226 Difference]: Without dead ends: 123 [2018-12-02 02:23:13,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 40.9s TimeCoverageRelationStatistics Valid=430, Invalid=6514, Unknown=28, NotChecked=0, Total=6972 [2018-12-02 02:23:13,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-02 02:23:13,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2018-12-02 02:23:13,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-02 02:23:13,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2018-12-02 02:23:13,699 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 79 [2018-12-02 02:23:13,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:23:13,699 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2018-12-02 02:23:13,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-02 02:23:13,699 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2018-12-02 02:23:13,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-02 02:23:13,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:23:13,700 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:23:13,700 INFO L423 AbstractCegarLoop]: === Iteration 23 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:23:13,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:23:13,700 INFO L82 PathProgramCache]: Analyzing trace with hash -2068123650, now seen corresponding path program 1 times [2018-12-02 02:23:13,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:23:13,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:23:13,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:23:13,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:23:13,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:23:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:23:13,728 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-02 02:23:13,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:23:13,729 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:23:13,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:23:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:23:13,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:23:13,782 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-02 02:23:13,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:23:13,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-02 02:23:13,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 02:23:13,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 02:23:13,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 02:23:13,798 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 8 states. [2018-12-02 02:23:13,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:23:13,845 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-12-02 02:23:13,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 02:23:13,845 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2018-12-02 02:23:13,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:23:13,846 INFO L225 Difference]: With dead ends: 96 [2018-12-02 02:23:13,846 INFO L226 Difference]: Without dead ends: 96 [2018-12-02 02:23:13,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-12-02 02:23:13,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-02 02:23:13,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-02 02:23:13,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-02 02:23:13,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-12-02 02:23:13,849 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 79 [2018-12-02 02:23:13,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:23:13,849 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-12-02 02:23:13,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 02:23:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-12-02 02:23:13,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 02:23:13,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:23:13,850 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:23:13,850 INFO L423 AbstractCegarLoop]: === Iteration 24 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:23:13,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:23:13,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1402031402, now seen corresponding path program 1 times [2018-12-02 02:23:13,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:23:13,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:23:13,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:23:13,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:23:13,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:23:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:23:13,896 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-02 02:23:13,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:23:13,896 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:23:13,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:23:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:23:13,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:23:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-02 02:23:13,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:23:13,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-12-02 02:23:13,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 02:23:13,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 02:23:13,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-02 02:23:13,991 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 9 states. [2018-12-02 02:23:14,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:23:14,076 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2018-12-02 02:23:14,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 02:23:14,076 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-12-02 02:23:14,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:23:14,076 INFO L225 Difference]: With dead ends: 100 [2018-12-02 02:23:14,076 INFO L226 Difference]: Without dead ends: 96 [2018-12-02 02:23:14,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:23:14,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-02 02:23:14,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-02 02:23:14,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-02 02:23:14,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-12-02 02:23:14,078 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 87 [2018-12-02 02:23:14,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:23:14,078 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-12-02 02:23:14,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 02:23:14,078 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-12-02 02:23:14,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-02 02:23:14,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:23:14,079 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:23:14,079 INFO L423 AbstractCegarLoop]: === Iteration 25 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:23:14,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:23:14,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1467646416, now seen corresponding path program 1 times [2018-12-02 02:23:14,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:23:14,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:23:14,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:23:14,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:23:14,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:23:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:23:14,212 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-02 02:23:14,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:23:14,212 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:23:14,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:23:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:23:14,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:23:14,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 02:23:14,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:23:14,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:23:14,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 02:23:14,476 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-02 02:23:14,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:23:14,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 25 [2018-12-02 02:23:14,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-02 02:23:14,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-02 02:23:14,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-12-02 02:23:14,492 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 26 states. [2018-12-02 02:23:14,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:23:14,740 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2018-12-02 02:23:14,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 02:23:14,740 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 90 [2018-12-02 02:23:14,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:23:14,740 INFO L225 Difference]: With dead ends: 102 [2018-12-02 02:23:14,741 INFO L226 Difference]: Without dead ends: 102 [2018-12-02 02:23:14,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 73 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2018-12-02 02:23:14,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-02 02:23:14,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2018-12-02 02:23:14,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-02 02:23:14,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2018-12-02 02:23:14,742 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 90 [2018-12-02 02:23:14,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:23:14,743 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2018-12-02 02:23:14,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-02 02:23:14,743 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2018-12-02 02:23:14,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 02:23:14,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:23:14,743 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:23:14,743 INFO L423 AbstractCegarLoop]: === Iteration 26 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:23:14,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:23:14,743 INFO L82 PathProgramCache]: Analyzing trace with hash -114103981, now seen corresponding path program 1 times [2018-12-02 02:23:14,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:23:14,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:23:14,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:23:14,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:23:14,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:23:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:23:14,804 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-02 02:23:14,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:23:14,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 02:23:14,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 02:23:14,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 02:23:14,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 02:23:14,805 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand 12 states. [2018-12-02 02:23:14,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:23:14,905 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2018-12-02 02:23:14,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 02:23:14,905 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2018-12-02 02:23:14,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:23:14,906 INFO L225 Difference]: With dead ends: 101 [2018-12-02 02:23:14,906 INFO L226 Difference]: Without dead ends: 99 [2018-12-02 02:23:14,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-12-02 02:23:14,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-02 02:23:14,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-12-02 02:23:14,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-02 02:23:14,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2018-12-02 02:23:14,909 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 93 [2018-12-02 02:23:14,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:23:14,909 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2018-12-02 02:23:14,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 02:23:14,909 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2018-12-02 02:23:14,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 02:23:14,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:23:14,910 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:23:14,910 INFO L423 AbstractCegarLoop]: === Iteration 27 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:23:14,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:23:14,910 INFO L82 PathProgramCache]: Analyzing trace with hash -944943971, now seen corresponding path program 1 times [2018-12-02 02:23:14,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:23:14,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:23:14,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:23:14,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:23:14,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:23:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:23:16,322 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 02:23:16,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:23:16,322 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:23:16,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:23:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:23:16,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:23:16,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 02:23:16,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:23:16,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:23:16,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 02:23:16,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:23:16,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:23:16,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 02:23:16,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:23:16,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:23:16,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-12-02 02:23:16,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 02:23:16,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 02:23:16,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:23:16,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:23:16,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:23:16,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-12-02 02:23:18,096 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (and (<= sll_update_at_~head.offset |c_sll_update_at_#in~head.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset))) |c_#memory_$Pointer$.base|))) is different from true [2018-12-02 02:23:18,101 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 26 treesize of output 21 [2018-12-02 02:23:18,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:23:18,104 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 21 treesize of output 17 [2018-12-02 02:23:18,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:23:18,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:23:18,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:23:18,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2018-12-02 02:23:20,246 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) (+ |c_sll_update_at_#in~head.offset| 4)))) (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| .cse0) sll_update_at_~head.offset)))))) is different from true [2018-12-02 02:23:20,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-12-02 02:23:20,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 24 treesize of output 1 [2018-12-02 02:23:20,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:23:20,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:23:20,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:23:20,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:17 [2018-12-02 02:23:22,265 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_23 Int) (v_main_~s~0.offset_BEFORE_CALL_23 Int)) (and (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_23) (+ v_main_~s~0.offset_BEFORE_CALL_23 4)) v_main_~s~0.base_BEFORE_CALL_23)) (<= 0 v_main_~s~0.offset_BEFORE_CALL_23) (<= v_main_~s~0.offset_BEFORE_CALL_23 0))) is different from true [2018-12-02 02:23:24,317 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_24 Int) (v_main_~s~0.offset_BEFORE_CALL_24 Int)) (and (<= 0 v_main_~s~0.offset_BEFORE_CALL_24) (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_24) (+ v_main_~s~0.offset_BEFORE_CALL_24 4)) v_main_~s~0.base_BEFORE_CALL_24)) (<= v_main_~s~0.offset_BEFORE_CALL_24 0))) is different from true [2018-12-02 02:23:28,383 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-02 02:23:28,986 WARN L180 SmtUtils]: Spent 550.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-02 02:23:29,694 WARN L180 SmtUtils]: Spent 659.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-02 02:23:31,753 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 24 [2018-12-02 02:23:31,945 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 31 treesize of output 25 [2018-12-02 02:23:31,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2018-12-02 02:23:31,950 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 02:23:31,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 02:23:31,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 02:23:31,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-12-02 02:23:32,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:23:32,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-02 02:23:32,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:23:32,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:23:32,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-12-02 02:23:32,195 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 9 not checked. [2018-12-02 02:23:32,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:23:32,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 37] total 76 [2018-12-02 02:23:32,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-02 02:23:32,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-02 02:23:32,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=5068, Unknown=5, NotChecked=580, Total=5852 [2018-12-02 02:23:32,211 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand 77 states. [2018-12-02 02:23:35,062 WARN L180 SmtUtils]: Spent 1.23 s on a formula simplification that was a NOOP. DAG size: 34 [2018-12-02 02:23:37,426 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 43 [2018-12-02 02:23:49,134 WARN L180 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2018-12-02 02:23:49,558 WARN L180 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-12-02 02:23:50,021 WARN L180 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2018-12-02 02:23:50,467 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2018-12-02 02:23:51,186 WARN L180 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2018-12-02 02:23:51,725 WARN L180 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2018-12-02 02:23:52,082 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-12-02 02:23:52,339 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-12-02 02:23:53,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:23:53,184 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-12-02 02:23:53,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-02 02:23:53,184 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 95 [2018-12-02 02:23:53,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:23:53,184 INFO L225 Difference]: With dead ends: 109 [2018-12-02 02:23:53,185 INFO L226 Difference]: Without dead ends: 109 [2018-12-02 02:23:53,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 65 SyntacticMatches, 10 SemanticMatches, 120 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3053 ImplicationChecksByTransitivity, 36.1s TimeCoverageRelationStatistics Valid=691, Invalid=13120, Unknown=11, NotChecked=940, Total=14762 [2018-12-02 02:23:53,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-02 02:23:53,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2018-12-02 02:23:53,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-02 02:23:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-12-02 02:23:53,188 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 95 [2018-12-02 02:23:53,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:23:53,189 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-12-02 02:23:53,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-02 02:23:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-12-02 02:23:53,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 02:23:53,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:23:53,189 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:23:53,189 INFO L423 AbstractCegarLoop]: === Iteration 28 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:23:53,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:23:53,189 INFO L82 PathProgramCache]: Analyzing trace with hash -944943970, now seen corresponding path program 1 times [2018-12-02 02:23:53,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:23:53,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:23:53,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:23:53,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:23:53,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:23:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:23:54,725 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 11 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 02:23:54,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:23:54,726 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:23:54,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:23:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:23:54,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:23:54,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 02:23:54,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:23:54,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 02:23:54,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:23:54,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:23:54,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 02:23:55,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:23:55,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:23:55,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 02:23:55,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:23:55,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 02:23:55,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:23:55,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:23:55,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-12-02 02:23:55,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 02:23:55,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 02:23:55,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:23:55,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:23:55,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 02:23:55,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 02:23:55,287 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:23:55,288 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:23:55,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:23:55,296 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:48 [2018-12-02 02:23:55,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 02:23:55,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-02 02:23:55,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:23:55,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:23:55,606 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 22 treesize of output 18 [2018-12-02 02:23:55,608 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 18 treesize of output 10 [2018-12-02 02:23:55,608 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:23:55,611 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:23:55,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 02:23:55,617 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:21 [2018-12-02 02:24:08,025 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 37 [2018-12-02 02:24:08,033 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 34 treesize of output 27 [2018-12-02 02:24:08,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:24:08,039 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 27 treesize of output 25 [2018-12-02 02:24:08,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:24:08,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:08,063 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 37 treesize of output 30 [2018-12-02 02:24:08,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:24:08,066 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 30 treesize of output 28 [2018-12-02 02:24:08,067 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:24:08,071 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:08,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 02:24:08,082 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:98, output treesize:65 [2018-12-02 02:24:08,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 02:24:08,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-02 02:24:08,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:24:08,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:08,181 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 22 treesize of output 18 [2018-12-02 02:24:08,182 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 18 treesize of output 10 [2018-12-02 02:24:08,182 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:24:08,185 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:24:08,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 02:24:08,192 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:21 [2018-12-02 02:24:08,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 106 [2018-12-02 02:24:08,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 36 treesize of output 1 [2018-12-02 02:24:08,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:24:08,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:08,646 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 64 treesize of output 65 [2018-12-02 02:24:08,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 36 treesize of output 1 [2018-12-02 02:24:08,648 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:24:08,651 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:08,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 02:24:08,664 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:155, output treesize:65 [2018-12-02 02:24:09,600 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 31 treesize of output 25 [2018-12-02 02:24:09,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2018-12-02 02:24:09,606 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 02:24:09,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 02:24:09,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-02 02:24:09,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 19 [2018-12-02 02:24:09,632 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-02 02:24:09,636 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:24:09,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-12-02 02:24:09,650 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:69, output treesize:100 [2018-12-02 02:24:10,042 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 02:24:10,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:24:10,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 35] total 78 [2018-12-02 02:24:10,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-02 02:24:10,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-02 02:24:10,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=5929, Unknown=7, NotChecked=0, Total=6162 [2018-12-02 02:24:10,058 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 79 states. [2018-12-02 02:24:26,218 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 42 [2018-12-02 02:24:40,894 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 59 [2018-12-02 02:24:45,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:24:45,405 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2018-12-02 02:24:45,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-02 02:24:45,405 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 95 [2018-12-02 02:24:45,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:24:45,405 INFO L225 Difference]: With dead ends: 110 [2018-12-02 02:24:45,405 INFO L226 Difference]: Without dead ends: 110 [2018-12-02 02:24:45,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 61 SyntacticMatches, 10 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2154 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=695, Invalid=11954, Unknown=7, NotChecked=0, Total=12656 [2018-12-02 02:24:45,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-02 02:24:45,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2018-12-02 02:24:45,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-02 02:24:45,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-12-02 02:24:45,408 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 95 [2018-12-02 02:24:45,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:24:45,408 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-12-02 02:24:45,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-02 02:24:45,408 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-12-02 02:24:45,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 02:24:45,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:24:45,408 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:24:45,409 INFO L423 AbstractCegarLoop]: === Iteration 29 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:24:45,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:24:45,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1611562043, now seen corresponding path program 1 times [2018-12-02 02:24:45,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:24:45,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:24:45,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:24:45,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:24:45,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:24:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:24:46,045 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 02:24:46,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:24:46,045 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:24:46,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:24:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:24:46,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:24:46,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 02:24:46,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:24:46,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:46,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 02:24:46,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 02:24:46,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 02:24:46,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:24:46,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:46,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:46,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-12-02 02:24:46,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-12-02 02:24:46,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:24:46,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-02 02:24:46,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:24:46,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:46,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:46,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2018-12-02 02:24:47,099 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:24:47,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:24:47,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 02:24:47,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:38 [2018-12-02 02:24:47,692 WARN L180 SmtUtils]: Spent 536.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-02 02:24:48,247 WARN L180 SmtUtils]: Spent 509.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-02 02:24:48,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:24:48,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-12-02 02:24:48,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-02 02:24:48,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:24:48,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-02 02:24:48,261 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 02:24:48,265 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:48,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:48,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:48,285 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:60, output treesize:44 [2018-12-02 02:24:48,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 02:24:48,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 02:24:48,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:24:48,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:48,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 02:24:48,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 02:24:48,415 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:24:48,417 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:48,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:24:48,437 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 27 treesize of output 34 [2018-12-02 02:24:48,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-02 02:24:48,439 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 02:24:48,444 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:48,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:48,458 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:89, output treesize:80 [2018-12-02 02:24:48,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:24:48,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 58 [2018-12-02 02:24:48,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 46 [2018-12-02 02:24:48,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:24:48,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:48,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-12-02 02:24:48,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2018-12-02 02:24:48,866 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:24:48,873 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:24:48,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-02 02:24:48,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-02 02:24:48,893 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:24:48,894 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:24:48,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-02 02:24:48,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-02 02:24:48,907 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 02:24:48,908 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:48,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 02:24:48,916 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:94, output treesize:29 [2018-12-02 02:24:50,493 WARN L180 SmtUtils]: Spent 687.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-12-02 02:24:50,501 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 85 treesize of output 72 [2018-12-02 02:24:50,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:24:50,507 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 72 treesize of output 76 [2018-12-02 02:24:50,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:24:50,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:50,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:24:50,548 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 31 treesize of output 38 [2018-12-02 02:24:50,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 02:24:50,550 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:24:50,556 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:50,580 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 35 treesize of output 30 [2018-12-02 02:24:50,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:24:50,584 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 30 treesize of output 26 [2018-12-02 02:24:50,584 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 02:24:50,588 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:50,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 02:24:50,604 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:148, output treesize:88 [2018-12-02 02:24:50,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:24:50,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 58 [2018-12-02 02:24:50,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 46 [2018-12-02 02:24:50,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:24:50,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:50,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-12-02 02:24:50,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 3 [2018-12-02 02:24:50,740 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:24:50,741 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:50,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-12-02 02:24:50,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-02 02:24:50,753 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:24:50,755 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:24:50,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 02:24:50,772 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:94, output treesize:29 [2018-12-02 02:24:58,018 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 43 [2018-12-02 02:24:58,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 55 [2018-12-02 02:24:58,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 38 treesize of output 37 [2018-12-02 02:24:58,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:24:58,068 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 43 [2018-12-02 02:24:58,068 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 02:24:58,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:24:58,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:24:58,123 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 81 treesize of output 82 [2018-12-02 02:24:58,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 17 [2018-12-02 02:24:58,125 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 02:24:58,136 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:58,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 88 [2018-12-02 02:24:58,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 83 treesize of output 71 [2018-12-02 02:24:58,153 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 02:24:58,193 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 61 [2018-12-02 02:24:58,194 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 02:24:58,218 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 02:24:58,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:24:58,275 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 81 treesize of output 88 [2018-12-02 02:24:58,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2018-12-02 02:24:58,278 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 02:24:58,288 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:24:58,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 61 [2018-12-02 02:24:58,294 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2018-12-02 02:24:58,295 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:24:58,305 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:24:58,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 94 [2018-12-02 02:24:58,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 71 [2018-12-02 02:24:58,323 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 02:24:58,363 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 79 [2018-12-02 02:24:58,364 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 02:24:58,388 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 02:24:58,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 11 dim-0 vars, and 4 xjuncts. [2018-12-02 02:24:58,458 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:148, output treesize:298 [2018-12-02 02:25:02,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:02,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2018-12-02 02:25:02,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:02,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-12-02 02:25:02,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:25:02,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:25:02,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:02,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2018-12-02 02:25:02,859 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 15 [2018-12-02 02:25:02,859 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:25:02,865 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:25:02,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-02 02:25:02,877 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:88, output treesize:66 [2018-12-02 02:25:11,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:11,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-12-02 02:25:11,331 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 29 treesize of output 27 [2018-12-02 02:25:11,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:25:11,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:25:11,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:11,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2018-12-02 02:25:11,354 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 15 [2018-12-02 02:25:11,355 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:25:11,360 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:25:11,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-02 02:25:11,372 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:88, output treesize:66 [2018-12-02 02:25:23,995 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 95 treesize of output 93 [2018-12-02 02:25:23,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 17 treesize of output 13 [2018-12-02 02:25:23,997 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:25:24,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:25:24,017 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 106 treesize of output 104 [2018-12-02 02:25:24,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 17 treesize of output 13 [2018-12-02 02:25:24,019 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:25:24,040 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:25:24,172 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 106 treesize of output 98 [2018-12-02 02:25:24,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 3 [2018-12-02 02:25:24,174 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 02:25:24,189 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:25:24,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 99 [2018-12-02 02:25:24,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 95 treesize of output 93 [2018-12-02 02:25:24,198 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 02:25:24,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 89 [2018-12-02 02:25:24,245 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-02 02:25:24,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 90 treesize of output 82 [2018-12-02 02:25:24,296 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 02:25:24,344 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 02:25:24,522 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 79 treesize of output 77 [2018-12-02 02:25:24,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2018-12-02 02:25:24,524 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 02:25:24,537 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:25:24,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 113 [2018-12-02 02:25:24,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 105 [2018-12-02 02:25:24,722 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 8 xjuncts. [2018-12-02 02:25:24,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 95 [2018-12-02 02:25:24,978 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 8 xjuncts. [2018-12-02 02:25:25,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 101 treesize of output 99 [2018-12-02 02:25:25,148 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 02:25:25,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 91 treesize of output 89 [2018-12-02 02:25:25,428 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 02:25:25,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2018-12-02 02:25:25,566 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-12-02 02:25:25,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 85 treesize of output 83 [2018-12-02 02:25:25,701 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 02:25:25,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 96 treesize of output 94 [2018-12-02 02:25:25,958 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 02:25:26,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 101 [2018-12-02 02:25:26,092 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-12-02 02:25:26,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 90 [2018-12-02 02:25:26,222 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-12-02 02:25:26,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 91 treesize of output 89 [2018-12-02 02:25:26,345 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 02:25:26,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 87 treesize of output 85 [2018-12-02 02:25:26,461 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 02:25:26,558 INFO L267 ElimStorePlain]: Start of recursive call 14: 13 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-02 02:25:26,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 104 [2018-12-02 02:25:26,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 98 [2018-12-02 02:25:26,567 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 02:25:26,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 94 [2018-12-02 02:25:26,625 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-12-02 02:25:26,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 95 treesize of output 93 [2018-12-02 02:25:26,696 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-02 02:25:26,766 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 02:25:27,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 4 dim-2 vars, End of recursive call: 38 dim-0 vars, and 10 xjuncts. [2018-12-02 02:25:27,036 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 18 variables, input treesize:425, output treesize:763 [2018-12-02 02:25:31,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:31,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 59 [2018-12-02 02:25:32,002 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-02 02:25:32,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:25:32,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,006 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 33 [2018-12-02 02:25:32,006 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 02:25:32,007 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-02 02:25:32,007 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:25:32,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 42 [2018-12-02 02:25:32,013 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 02:25:32,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 54 [2018-12-02 02:25:32,019 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 02:25:32,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 44 [2018-12-02 02:25:32,026 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 02:25:32,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:25:32,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 63 [2018-12-02 02:25:32,036 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 02:25:32,037 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-02 02:25:32,037 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 02:25:32,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:25:32,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 02:25:32,072 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:87, output treesize:24 [2018-12-02 02:25:34,487 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2018-12-02 02:25:36,552 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2018-12-02 02:25:36,556 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-02 02:25:36,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:25:36,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:25:36,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:120, output treesize:1 [2018-12-02 02:25:36,609 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 02:25:36,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:25:36,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 48] total 79 [2018-12-02 02:25:36,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-02 02:25:36,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-02 02:25:36,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=5847, Unknown=18, NotChecked=0, Total=6162 [2018-12-02 02:25:36,625 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 79 states. [2018-12-02 02:25:40,523 WARN L180 SmtUtils]: Spent 914.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-12-02 02:25:41,697 WARN L180 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2018-12-02 02:25:57,598 WARN L180 SmtUtils]: Spent 496.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-12-02 02:26:00,570 WARN L180 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2018-12-02 02:26:06,138 WARN L180 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2018-12-02 02:26:13,292 WARN L180 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2018-12-02 02:26:44,618 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2018-12-02 02:27:37,526 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2018-12-02 02:27:40,135 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2018-12-02 02:28:10,744 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2018-12-02 02:28:12,812 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2018-12-02 02:28:15,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:28:15,380 INFO L93 Difference]: Finished difference Result 200 states and 207 transitions. [2018-12-02 02:28:15,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-02 02:28:15,381 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 98 [2018-12-02 02:28:15,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:28:15,381 INFO L225 Difference]: With dead ends: 200 [2018-12-02 02:28:15,381 INFO L226 Difference]: Without dead ends: 196 [2018-12-02 02:28:15,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6702 ImplicationChecksByTransitivity, 107.3s TimeCoverageRelationStatistics Valid=1209, Invalid=20185, Unknown=68, NotChecked=0, Total=21462 [2018-12-02 02:28:15,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-02 02:28:15,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 111. [2018-12-02 02:28:15,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-02 02:28:15,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions. [2018-12-02 02:28:15,386 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 98 [2018-12-02 02:28:15,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:28:15,386 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 114 transitions. [2018-12-02 02:28:15,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-02 02:28:15,386 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2018-12-02 02:28:15,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 02:28:15,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:28:15,387 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:28:15,387 INFO L423 AbstractCegarLoop]: === Iteration 30 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:28:15,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:28:15,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1188097393, now seen corresponding path program 2 times [2018-12-02 02:28:15,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:28:15,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:28:15,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:28:15,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:28:15,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:28:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:28:16,475 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2018-12-02 02:28:17,723 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 02:28:17,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:28:17,723 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:28:17,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 02:28:17,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 02:28:17,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 02:28:17,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:28:17,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 02:28:17,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:28:17,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 02:28:17,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:28:17,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:28:17,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 02:28:17,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 3 [2018-12-02 02:28:17,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:28:17,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 02:28:17,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 02:28:17,986 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 02:28:17,987 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:28:17,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 02:28:17,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 02:28:17,998 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 02:28:17,999 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:28:18,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:28:18,004 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:50, output treesize:30 [2018-12-02 02:28:18,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:28:18,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:28:18,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 02:28:18,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:28:18,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-02 02:28:18,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 17 treesize of output 20 [2018-12-02 02:28:18,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:28:18,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 02:28:18,293 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:28:18,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:28:18,301 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:28:18,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-02 02:28:18,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 17 treesize of output 20 [2018-12-02 02:28:18,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:28:18,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 02:28:18,319 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 02:28:18,321 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:28:18,324 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:28:18,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:28:18,332 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:78, output treesize:50 [2018-12-02 02:28:18,445 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 02:28:18,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-12-02 02:28:18,448 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 9 [2018-12-02 02:28:18,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:28:18,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:28:18,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-12-02 02:28:18,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-02 02:28:18,465 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:28:18,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:28:18,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:28:18,475 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:73, output treesize:56 [2018-12-02 02:28:18,912 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 40 treesize of output 45 [2018-12-02 02:28:18,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 15 [2018-12-02 02:28:18,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 02:28:18,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:28:18,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-12-02 02:28:18,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 28 [2018-12-02 02:28:18,946 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:28:18,950 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:28:18,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2018-12-02 02:28:18,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 38 [2018-12-02 02:28:18,963 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 02:28:18,974 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 02:28:18,995 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 3 xjuncts. [2018-12-02 02:28:18,995 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:86, output treesize:122 [2018-12-02 02:28:19,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 135 [2018-12-02 02:28:19,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 101 [2018-12-02 02:28:19,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 02:28:20,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 101 [2018-12-02 02:28:20,151 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 02:28:20,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 74 [2018-12-02 02:28:20,344 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:28:20,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 02:28:20,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 84 [2018-12-02 02:28:20,515 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 02:28:20,517 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 44 treesize of output 11 [2018-12-02 02:28:20,517 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 02:28:20,523 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:28:20,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 117 [2018-12-02 02:28:20,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 49 [2018-12-02 02:28:20,555 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 02:28:20,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 56 [2018-12-02 02:28:20,660 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-02 02:28:20,697 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:28:20,701 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 67 treesize of output 58 [2018-12-02 02:28:20,704 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 30 treesize of output 1 [2018-12-02 02:28:20,704 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 02:28:20,710 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:28:20,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 146 treesize of output 195 [2018-12-02 02:28:20,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 154 treesize of output 138 [2018-12-02 02:28:20,804 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-12-02 02:28:21,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:28:21,622 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 165 [2018-12-02 02:28:21,624 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-12-02 02:28:21,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 137 treesize of output 101 [2018-12-02 02:28:21,958 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 02:28:22,075 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-02 02:28:22,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 86 [2018-12-02 02:28:22,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 78 [2018-12-02 02:28:22,314 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:28:22,325 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:28:22,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 108 [2018-12-02 02:28:22,335 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 02:28:22,336 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 44 treesize of output 47 [2018-12-02 02:28:22,337 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 02:28:22,346 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:28:22,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 84 [2018-12-02 02:28:22,356 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 75 treesize of output 58 [2018-12-02 02:28:22,356 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-02 02:28:22,365 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:28:22,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 120 [2018-12-02 02:28:22,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 118 treesize of output 82 [2018-12-02 02:28:22,395 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 02:28:22,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 118 [2018-12-02 02:28:22,498 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-12-02 02:28:22,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 85 treesize of output 88 [2018-12-02 02:28:22,582 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-02 02:28:22,640 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-02 02:28:22,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 7 xjuncts. [2018-12-02 02:28:22,718 INFO L202 ElimStorePlain]: Needed 26 recursive calls to eliminate 6 variables, input treesize:266, output treesize:409 [2018-12-02 02:28:24,766 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 02:28:24,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2018-12-02 02:28:24,769 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 02:28:24,769 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 42 treesize of output 28 [2018-12-02 02:28:24,770 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:28:24,779 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 1 case distinctions, treesize of input 15 treesize of output 12 [2018-12-02 02:28:24,779 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 02:28:24,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 02:28:24,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-12-02 02:28:24,804 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 1 case distinctions, treesize of input 15 treesize of output 12 [2018-12-02 02:28:24,804 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-02 02:28:24,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 02:28:24,810 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 02:28:24,813 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 02:28:24,815 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 40 treesize of output 38 [2018-12-02 02:28:24,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 02:28:24,817 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 02:28:24,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:28:24,823 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 15 treesize of output 8 [2018-12-02 02:28:24,823 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 02:28:24,825 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:28:24,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 02:28:24,837 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:82, output treesize:28 [2018-12-02 02:28:24,987 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-02 02:28:25,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:28:25,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41] total 69 [2018-12-02 02:28:25,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-02 02:28:25,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-02 02:28:25,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=4430, Unknown=16, NotChecked=0, Total=4692 [2018-12-02 02:28:25,003 INFO L87 Difference]: Start difference. First operand 111 states and 114 transitions. Second operand 69 states. [2018-12-02 02:28:31,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:28:31,752 INFO L93 Difference]: Finished difference Result 188 states and 195 transitions. [2018-12-02 02:28:31,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-02 02:28:31,752 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 100 [2018-12-02 02:28:31,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:28:31,752 INFO L225 Difference]: With dead ends: 188 [2018-12-02 02:28:31,752 INFO L226 Difference]: Without dead ends: 188 [2018-12-02 02:28:31,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 67 SyntacticMatches, 16 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=628, Invalid=9657, Unknown=17, NotChecked=0, Total=10302 [2018-12-02 02:28:31,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-02 02:28:31,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 169. [2018-12-02 02:28:31,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-02 02:28:31,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 176 transitions. [2018-12-02 02:28:31,756 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 176 transitions. Word has length 100 [2018-12-02 02:28:31,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:28:31,756 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 176 transitions. [2018-12-02 02:28:31,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-02 02:28:31,756 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 176 transitions. [2018-12-02 02:28:31,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 02:28:31,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:28:31,756 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:28:31,756 INFO L423 AbstractCegarLoop]: === Iteration 31 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:28:31,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:28:31,757 INFO L82 PathProgramCache]: Analyzing trace with hash 214671507, now seen corresponding path program 2 times [2018-12-02 02:28:31,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:28:31,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:28:31,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:28:31,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:28:31,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:28:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:28:32,687 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 02:28:32,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:28:32,688 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:28:32,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 02:28:32,728 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 02:28:32,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 02:28:32,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:28:33,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 02:28:33,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 02:28:33,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:28:33,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:28:33,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:28:33,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:42 [2018-12-02 02:28:33,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:28:33,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 37 [2018-12-02 02:28:33,255 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 29 treesize of output 18 [2018-12-02 02:28:33,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:28:33,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:28:33,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-12-02 02:28:33,264 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-12-02 02:28:33,265 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:28:33,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:28:33,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 02:28:33,271 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:18 [2018-12-02 02:28:42,828 WARN L180 SmtUtils]: Spent 1.86 s on a formula simplification that was a NOOP. DAG size: 27 [2018-12-02 02:28:42,832 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 52 treesize of output 43 [2018-12-02 02:28:42,840 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 36 [2018-12-02 02:28:42,840 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 02:28:42,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 02:28:42,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-02 02:28:42,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:104 [2018-12-02 02:28:43,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:28:43,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2018-12-02 02:28:43,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:28:43,024 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 28 [2018-12-02 02:28:43,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:28:43,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:28:43,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:28:43,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-12-02 02:28:43,044 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 25 treesize of output 10 [2018-12-02 02:28:43,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:28:43,048 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:28:43,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-12-02 02:28:43,058 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-12-02 02:28:43,059 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:28:43,062 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:28:43,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-02 02:28:43,071 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:79, output treesize:37 [2018-12-02 02:29:00,265 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-02 02:29:00,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 87 [2018-12-02 02:29:00,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 81 treesize of output 57 [2018-12-02 02:29:00,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:29:00,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:29:00,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, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 90 [2018-12-02 02:29:00,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 66 [2018-12-02 02:29:00,360 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:29:00,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:29:00,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:29:00,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 80 [2018-12-02 02:29:00,416 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-02 02:29:00,458 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 02:29:00,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-12-02 02:29:00,500 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:170, output treesize:163 [2018-12-02 02:29:00,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:29:00,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2018-12-02 02:29:00,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:29:00,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-12-02 02:29:00,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:29:00,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:29:00,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:29:00,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-12-02 02:29:00,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:29:00,768 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 28 [2018-12-02 02:29:00,768 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:29:00,772 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:29:00,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:29:00,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2018-12-02 02:29:00,790 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 25 treesize of output 10 [2018-12-02 02:29:00,790 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 02:29:00,793 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:29:00,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-02 02:29:00,805 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:116, output treesize:67 [2018-12-02 02:29:01,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:29:01,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-12-02 02:29:01,023 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 29 treesize of output 18 [2018-12-02 02:29:01,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:29:01,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:29:01,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:29:01,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2018-12-02 02:29:01,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:29:01,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-12-02 02:29:01,050 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:29:01,056 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:29:01,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:29:01,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2018-12-02 02:29:01,074 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 25 treesize of output 10 [2018-12-02 02:29:01,075 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 02:29:01,079 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:29:01,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-02 02:29:01,092 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:116, output treesize:67 [2018-12-02 02:29:01,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:29:01,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-12-02 02:29:01,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-12-02 02:29:01,587 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:29:01,591 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:29:01,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 02:29:01,595 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:55, output treesize:26 [2018-12-02 02:29:11,084 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 23 refuted. 2 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-02 02:29:11,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:29:11,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34] total 61 [2018-12-02 02:29:11,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-02 02:29:11,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-02 02:29:11,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=3547, Unknown=34, NotChecked=0, Total=3782 [2018-12-02 02:29:11,100 INFO L87 Difference]: Start difference. First operand 169 states and 176 transitions. Second operand 62 states. [2018-12-02 02:29:47,614 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2018-12-02 02:30:00,340 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-02 02:30:16,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:30:16,460 INFO L93 Difference]: Finished difference Result 183 states and 191 transitions. [2018-12-02 02:30:16,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-02 02:30:16,461 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 103 [2018-12-02 02:30:16,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:30:16,461 INFO L225 Difference]: With dead ends: 183 [2018-12-02 02:30:16,461 INFO L226 Difference]: Without dead ends: 128 [2018-12-02 02:30:16,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 77 SyntacticMatches, 11 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1649 ImplicationChecksByTransitivity, 51.7s TimeCoverageRelationStatistics Valid=513, Invalid=7640, Unknown=37, NotChecked=0, Total=8190 [2018-12-02 02:30:16,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-02 02:30:16,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2018-12-02 02:30:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-02 02:30:16,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2018-12-02 02:30:16,464 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 103 [2018-12-02 02:30:16,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:30:16,464 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2018-12-02 02:30:16,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-02 02:30:16,465 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2018-12-02 02:30:16,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 02:30:16,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:30:16,465 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:30:16,465 INFO L423 AbstractCegarLoop]: === Iteration 32 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-02 02:30:16,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:30:16,465 INFO L82 PathProgramCache]: Analyzing trace with hash 376668779, now seen corresponding path program 3 times [2018-12-02 02:30:16,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:30:16,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:30:16,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:30:16,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:30:16,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:30:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:30:16,504 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-02 02:30:16,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:30:16,504 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:30:16,513 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 02:30:16,628 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 02:30:16,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 02:30:16,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:30:16,640 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-02 02:30:16,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:30:16,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-02 02:30:16,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:30:16,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:30:16,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:30:16,658 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand 7 states. [2018-12-02 02:30:16,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:30:16,697 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-12-02 02:30:16,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:30:16,698 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-02 02:30:16,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:30:16,698 INFO L225 Difference]: With dead ends: 44 [2018-12-02 02:30:16,698 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 02:30:16,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-02 02:30:16,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 02:30:16,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 02:30:16,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 02:30:16,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 02:30:16,698 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2018-12-02 02:30:16,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:30:16,698 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 02:30:16,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:30:16,699 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 02:30:16,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 02:30:16,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:30:16 BoogieIcfgContainer [2018-12-02 02:30:16,702 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 02:30:16,702 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 02:30:16,702 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 02:30:16,702 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 02:30:16,702 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:21:20" (3/4) ... [2018-12-02 02:30:16,704 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 02:30:16,709 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 02:30:16,709 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-12-02 02:30:16,709 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_destroy [2018-12-02 02:30:16,709 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_update_at [2018-12-02 02:30:16,709 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-02 02:30:16,709 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-02 02:30:16,709 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2018-12-02 02:30:16,709 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_get_data_at [2018-12-02 02:30:16,709 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 02:30:16,709 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-12-02 02:30:16,712 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-12-02 02:30:16,712 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-02 02:30:16,712 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 02:30:16,737 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6af63c7e-6488-4a33-8059-ed6ad2d8dc4b/bin-2019/uautomizer/witness.graphml [2018-12-02 02:30:16,737 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 02:30:16,738 INFO L168 Benchmark]: Toolchain (without parser) took 537033.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 951.7 MB in the beginning and 1.0 GB in the end (delta: -62.4 MB). Peak memory consumption was 44.1 MB. Max. memory is 11.5 GB. [2018-12-02 02:30:16,738 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:30:16,738 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -123.1 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-12-02 02:30:16,738 INFO L168 Benchmark]: Boogie Preprocessor took 31.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-12-02 02:30:16,738 INFO L168 Benchmark]: RCFGBuilder took 290.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2018-12-02 02:30:16,738 INFO L168 Benchmark]: TraceAbstraction took 536404.07 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.7 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 4.4 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2018-12-02 02:30:16,738 INFO L168 Benchmark]: Witness Printer took 35.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:30:16,739 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 269.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -123.1 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 290.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 536404.07 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.7 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 4.4 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * Witness Printer took 35.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 584]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 584]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 602]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: 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 11 procedures, 94 locations, 19 error locations. SAFE Result, 536.3s OverallTime, 32 OverallIterations, 3 TraceHistogramMax, 364.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1985 SDtfs, 3409 SDslu, 14605 SDs, 0 SdLazy, 30861 SolverSat, 1089 SolverUnsat, 186 SolverUnknown, 0 SolverNotchecked, 236.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2402 GetRequests, 1228 SyntacticMatches, 96 SemanticMatches, 1078 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 20313 ImplicationChecksByTransitivity, 283.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=30, 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.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 348 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 169.9s InterpolantComputationTime, 3439 NumberOfCodeBlocks, 3439 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 3388 ConstructedInterpolants, 353 QuantifiedInterpolants, 4068852 SizeOfPredicates, 288 NumberOfNonLiveVariables, 6800 ConjunctsInSsa, 1092 ConjunctsInUnsatCore, 51 InterpolantComputations, 17 PerfectInterpolantSequences, 1041/1498 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...