./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse_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_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/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 16891def4f6ae6ab6c00fe328146dbdee1a68356 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 05:32:44,701 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 05:32:44,701 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 05:32:44,707 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 05:32:44,708 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 05:32:44,708 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 05:32:44,709 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 05:32:44,710 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 05:32:44,711 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 05:32:44,711 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 05:32:44,711 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 05:32:44,712 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 05:32:44,712 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 05:32:44,713 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 05:32:44,713 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 05:32:44,714 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 05:32:44,714 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 05:32:44,715 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 05:32:44,717 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 05:32:44,718 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 05:32:44,718 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 05:32:44,719 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 05:32:44,721 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 05:32:44,721 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 05:32:44,721 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 05:32:44,722 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 05:32:44,723 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 05:32:44,723 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 05:32:44,724 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 05:32:44,725 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 05:32:44,725 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 05:32:44,725 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 05:32:44,725 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 05:32:44,725 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 05:32:44,726 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 05:32:44,727 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 05:32:44,727 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-02 05:32:44,737 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 05:32:44,737 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 05:32:44,737 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 05:32:44,738 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 05:32:44,738 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 05:32:44,738 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 05:32:44,738 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 05:32:44,739 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 05:32:44,739 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 05:32:44,739 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 05:32:44,739 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 05:32:44,739 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 05:32:44,739 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 05:32:44,739 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 05:32:44,739 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 05:32:44,740 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 05:32:44,740 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 05:32:44,740 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 05:32:44,740 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 05:32:44,740 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 05:32:44,740 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 05:32:44,740 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 05:32:44,740 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 05:32:44,741 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:32:44,741 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 05:32:44,741 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 05:32:44,741 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 05:32:44,741 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 05:32:44,741 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_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/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 -> 16891def4f6ae6ab6c00fe328146dbdee1a68356 [2018-12-02 05:32:44,765 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 05:32:44,775 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 05:32:44,777 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 05:32:44,778 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 05:32:44,779 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 05:32:44,779 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-02 05:32:44,821 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/bin-2019/uautomizer/data/f40d8aabf/0c1e3528a5864f0ca6c08b9390ddfccb/FLAG19f574cb8 [2018-12-02 05:32:45,299 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 05:32:45,299 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/sv-benchmarks/c/list-simple/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-02 05:32:45,305 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/bin-2019/uautomizer/data/f40d8aabf/0c1e3528a5864f0ca6c08b9390ddfccb/FLAG19f574cb8 [2018-12-02 05:32:45,799 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/bin-2019/uautomizer/data/f40d8aabf/0c1e3528a5864f0ca6c08b9390ddfccb [2018-12-02 05:32:45,801 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 05:32:45,802 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 05:32:45,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 05:32:45,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 05:32:45,805 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 05:32:45,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:32:45" (1/1) ... [2018-12-02 05:32:45,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44149d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:32:45, skipping insertion in model container [2018-12-02 05:32:45,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:32:45" (1/1) ... [2018-12-02 05:32:45,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 05:32:45,829 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 05:32:45,985 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:32:46,028 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 05:32:46,057 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:32:46,090 INFO L195 MainTranslator]: Completed translation [2018-12-02 05:32:46,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:32:46 WrapperNode [2018-12-02 05:32:46,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 05:32:46,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 05:32:46,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 05:32:46,091 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 05:32:46,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:32:46" (1/1) ... [2018-12-02 05:32:46,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:32:46" (1/1) ... [2018-12-02 05:32:46,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:32:46" (1/1) ... [2018-12-02 05:32:46,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:32:46" (1/1) ... [2018-12-02 05:32:46,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:32:46" (1/1) ... [2018-12-02 05:32:46,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:32:46" (1/1) ... [2018-12-02 05:32:46,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:32:46" (1/1) ... [2018-12-02 05:32:46,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 05:32:46,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 05:32:46,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 05:32:46,123 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 05:32:46,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:32:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/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 05:32:46,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 05:32:46,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 05:32:46,154 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-02 05:32:46,154 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-02 05:32:46,154 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 05:32:46,154 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-02 05:32:46,154 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-12-02 05:32:46,154 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2018-12-02 05:32:46,154 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2018-12-02 05:32:46,154 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2018-12-02 05:32:46,154 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 05:32:46,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-02 05:32:46,155 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-02 05:32:46,155 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-02 05:32:46,155 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-02 05:32:46,155 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-02 05:32:46,155 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-02 05:32:46,155 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-02 05:32:46,155 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-02 05:32:46,155 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-02 05:32:46,155 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-02 05:32:46,155 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-02 05:32:46,155 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-02 05:32:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-02 05:32:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-02 05:32:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-02 05:32:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-02 05:32:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-02 05:32:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-02 05:32:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-02 05:32:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-02 05:32:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-02 05:32:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-02 05:32:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-02 05:32:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-02 05:32:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-02 05:32:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-02 05:32:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-02 05:32:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-02 05:32:46,157 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-02 05:32:46,157 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-02 05:32:46,157 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-02 05:32:46,157 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-02 05:32:46,157 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-02 05:32:46,157 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-02 05:32:46,157 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-02 05:32:46,157 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-02 05:32:46,157 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-02 05:32:46,157 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-02 05:32:46,157 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-02 05:32:46,157 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-02 05:32:46,157 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-02 05:32:46,157 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-02 05:32:46,157 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-02 05:32:46,157 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-02 05:32:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-02 05:32:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-02 05:32:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-02 05:32:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-02 05:32:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-02 05:32:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-02 05:32:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-02 05:32:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-02 05:32:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-02 05:32:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-02 05:32:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-02 05:32:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-02 05:32:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-02 05:32:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-02 05:32:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-02 05:32:46,158 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-02 05:32:46,159 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-02 05:32:46,159 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-02 05:32:46,159 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-02 05:32:46,159 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-02 05:32:46,159 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-02 05:32:46,159 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-02 05:32:46,159 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-02 05:32:46,159 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-02 05:32:46,159 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-02 05:32:46,159 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-02 05:32:46,159 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-02 05:32:46,159 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-02 05:32:46,159 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-02 05:32:46,159 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-02 05:32:46,159 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-02 05:32:46,159 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-02 05:32:46,159 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-02 05:32:46,160 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-02 05:32:46,160 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-02 05:32:46,160 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-02 05:32:46,160 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-02 05:32:46,160 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-02 05:32:46,160 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-02 05:32:46,160 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-02 05:32:46,160 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-02 05:32:46,160 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-02 05:32:46,160 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-02 05:32:46,160 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-02 05:32:46,160 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-02 05:32:46,160 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-02 05:32:46,160 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-02 05:32:46,160 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-02 05:32:46,160 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-02 05:32:46,160 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-02 05:32:46,161 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-02 05:32:46,161 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-02 05:32:46,161 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-02 05:32:46,161 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-02 05:32:46,161 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-02 05:32:46,161 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-02 05:32:46,161 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-02 05:32:46,161 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-02 05:32:46,161 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-02 05:32:46,161 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-02 05:32:46,161 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-02 05:32:46,161 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-02 05:32:46,161 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 05:32:46,161 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-02 05:32:46,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 05:32:46,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 05:32:46,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 05:32:46,162 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-12-02 05:32:46,162 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2018-12-02 05:32:46,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 05:32:46,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 05:32:46,162 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2018-12-02 05:32:46,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 05:32:46,162 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2018-12-02 05:32:46,162 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 05:32:46,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 05:32:46,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 05:32:46,422 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 05:32:46,423 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-02 05:32:46,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:32:46 BoogieIcfgContainer [2018-12-02 05:32:46,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 05:32:46,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 05:32:46,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 05:32:46,425 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 05:32:46,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:32:45" (1/3) ... [2018-12-02 05:32:46,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abfa29a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:32:46, skipping insertion in model container [2018-12-02 05:32:46,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:32:46" (2/3) ... [2018-12-02 05:32:46,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abfa29a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:32:46, skipping insertion in model container [2018-12-02 05:32:46,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:32:46" (3/3) ... [2018-12-02 05:32:46,427 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-02 05:32:46,433 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 05:32:46,438 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2018-12-02 05:32:46,448 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2018-12-02 05:32:46,463 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 05:32:46,463 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 05:32:46,463 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 05:32:46,463 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 05:32:46,463 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 05:32:46,464 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 05:32:46,464 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 05:32:46,464 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 05:32:46,464 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 05:32:46,474 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2018-12-02 05:32:46,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 05:32:46,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:32:46,480 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:32:46,482 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:32:46,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:32:46,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1843482384, now seen corresponding path program 1 times [2018-12-02 05:32:46,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:32:46,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:32:46,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:46,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:32:46,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:32:46,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:32:46,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:32:46,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 05:32:46,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:32:46,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:32:46,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:32:46,599 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 3 states. [2018-12-02 05:32:46,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:32:46,676 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-12-02 05:32:46,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:32:46,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-02 05:32:46,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:32:46,682 INFO L225 Difference]: With dead ends: 106 [2018-12-02 05:32:46,683 INFO L226 Difference]: Without dead ends: 99 [2018-12-02 05:32:46,684 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 05:32:46,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-02 05:32:46,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-02 05:32:46,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-02 05:32:46,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-12-02 05:32:46,709 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 12 [2018-12-02 05:32:46,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:32:46,709 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-12-02 05:32:46,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:32:46,709 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-12-02 05:32:46,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 05:32:46,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:32:46,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:32:46,710 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:32:46,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:32:46,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1843482383, now seen corresponding path program 1 times [2018-12-02 05:32:46,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:32:46,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:32:46,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:46,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:32:46,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:32:46,760 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 05:32:46,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:32:46,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 05:32:46,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:32:46,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:32:46,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:32:46,762 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 3 states. [2018-12-02 05:32:46,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:32:46,794 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2018-12-02 05:32:46,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:32:46,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-02 05:32:46,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:32:46,795 INFO L225 Difference]: With dead ends: 96 [2018-12-02 05:32:46,795 INFO L226 Difference]: Without dead ends: 96 [2018-12-02 05:32:46,795 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 05:32:46,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-02 05:32:46,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-02 05:32:46,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-02 05:32:46,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-12-02 05:32:46,800 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 12 [2018-12-02 05:32:46,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:32:46,800 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-12-02 05:32:46,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:32:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-12-02 05:32:46,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 05:32:46,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:32:46,801 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] [2018-12-02 05:32:46,801 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:32:46,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:32:46,801 INFO L82 PathProgramCache]: Analyzing trace with hash 92083562, now seen corresponding path program 1 times [2018-12-02 05:32:46,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:32:46,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:32:46,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:46,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:32:46,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:32:46,832 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 05:32:46,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:32:46,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:32:46,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:32:46,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:32:46,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:32:46,833 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 5 states. [2018-12-02 05:32:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:32:46,865 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-12-02 05:32:46,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:32:46,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-02 05:32:46,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:32:46,866 INFO L225 Difference]: With dead ends: 97 [2018-12-02 05:32:46,866 INFO L226 Difference]: Without dead ends: 97 [2018-12-02 05:32:46,866 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 05:32:46,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-02 05:32:46,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-02 05:32:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-02 05:32:46,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-12-02 05:32:46,871 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 20 [2018-12-02 05:32:46,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:32:46,872 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-12-02 05:32:46,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:32:46,872 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-12-02 05:32:46,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 05:32:46,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:32:46,873 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:32:46,873 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:32:46,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:32:46,873 INFO L82 PathProgramCache]: Analyzing trace with hash -612607148, now seen corresponding path program 1 times [2018-12-02 05:32:46,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:32:46,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:32:46,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:46,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:32:46,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:32:46,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 05:32:46,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:32:46,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:32:46,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:32:46,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:32:46,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:32:46,940 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 6 states. [2018-12-02 05:32:47,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:32:47,026 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2018-12-02 05:32:47,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:32:47,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-02 05:32:47,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:32:47,027 INFO L225 Difference]: With dead ends: 97 [2018-12-02 05:32:47,028 INFO L226 Difference]: Without dead ends: 97 [2018-12-02 05:32:47,028 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 05:32:47,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-02 05:32:47,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-12-02 05:32:47,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-02 05:32:47,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-12-02 05:32:47,032 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 30 [2018-12-02 05:32:47,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:32:47,032 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-12-02 05:32:47,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:32:47,033 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-12-02 05:32:47,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 05:32:47,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:32:47,033 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:32:47,033 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:32:47,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:32:47,033 INFO L82 PathProgramCache]: Analyzing trace with hash -612607149, now seen corresponding path program 1 times [2018-12-02 05:32:47,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:32:47,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:32:47,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:47,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:32:47,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:32:47,068 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 05:32:47,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:32:47,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:32:47,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:32:47,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:32:47,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:32:47,069 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 6 states. [2018-12-02 05:32:47,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:32:47,156 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2018-12-02 05:32:47,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:32:47,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-02 05:32:47,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:32:47,157 INFO L225 Difference]: With dead ends: 96 [2018-12-02 05:32:47,157 INFO L226 Difference]: Without dead ends: 96 [2018-12-02 05:32:47,157 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 05:32:47,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-02 05:32:47,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-12-02 05:32:47,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-02 05:32:47,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-12-02 05:32:47,161 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 30 [2018-12-02 05:32:47,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:32:47,161 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-12-02 05:32:47,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:32:47,161 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-12-02 05:32:47,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 05:32:47,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:32:47,162 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:32:47,162 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:32:47,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:32:47,162 INFO L82 PathProgramCache]: Analyzing trace with hash -304950988, now seen corresponding path program 1 times [2018-12-02 05:32:47,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:32:47,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:32:47,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:47,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:32:47,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:32:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:32:47,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:32:47,285 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/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 05:32:47,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:32:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:32:47,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:32:48,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 05:32:48,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:32:48,880 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 05:32:48,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-02 05:32:48,889 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:32:48,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:32:48,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-12-02 05:32:48,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:32:48,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:32:48,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=96, Unknown=4, NotChecked=0, Total=132 [2018-12-02 05:32:48,915 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 12 states. [2018-12-02 05:32:49,323 WARN L180 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-02 05:32:49,588 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-02 05:32:49,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:32:49,838 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2018-12-02 05:32:49,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 05:32:49,838 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-12-02 05:32:49,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:32:49,839 INFO L225 Difference]: With dead ends: 132 [2018-12-02 05:32:49,839 INFO L226 Difference]: Without dead ends: 132 [2018-12-02 05:32:49,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=58, Invalid=178, Unknown=4, NotChecked=0, Total=240 [2018-12-02 05:32:49,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-02 05:32:49,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 100. [2018-12-02 05:32:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 05:32:49,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2018-12-02 05:32:49,846 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 32 [2018-12-02 05:32:49,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:32:49,846 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2018-12-02 05:32:49,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:32:49,847 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-12-02 05:32:49,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 05:32:49,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:32:49,848 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:32:49,848 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:32:49,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:32:49,848 INFO L82 PathProgramCache]: Analyzing trace with hash -304950987, now seen corresponding path program 1 times [2018-12-02 05:32:49,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:32:49,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:32:49,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:49,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:32:49,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:32:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:32:49,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:32:49,966 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/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 05:32:49,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:32:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:32:50,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:32:50,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:32:50,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:32:50,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:32:50,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 05:32:50,291 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.base Int)) (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base 12))) is different from true [2018-12-02 05:32:50,297 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 05:32:50,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:32:50,301 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 05:32:50,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-02 05:32:50,307 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-12-02 05:32:50,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:32:50,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2018-12-02 05:32:50,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 05:32:50,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 05:32:50,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=56, Unknown=1, NotChecked=14, Total=90 [2018-12-02 05:32:50,323 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 10 states. [2018-12-02 05:32:50,840 WARN L180 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2018-12-02 05:32:51,363 WARN L180 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2018-12-02 05:32:51,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:32:51,553 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-12-02 05:32:51,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:32:51,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-12-02 05:32:51,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:32:51,554 INFO L225 Difference]: With dead ends: 101 [2018-12-02 05:32:51,554 INFO L226 Difference]: Without dead ends: 101 [2018-12-02 05:32:51,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=39, Invalid=120, Unknown=1, NotChecked=22, Total=182 [2018-12-02 05:32:51,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-02 05:32:51,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-12-02 05:32:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 05:32:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-12-02 05:32:51,557 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 32 [2018-12-02 05:32:51,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:32:51,557 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-12-02 05:32:51,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 05:32:51,557 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-12-02 05:32:51,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 05:32:51,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:32:51,558 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:32:51,558 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:32:51,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:32:51,558 INFO L82 PathProgramCache]: Analyzing trace with hash -999969269, now seen corresponding path program 1 times [2018-12-02 05:32:51,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:32:51,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:32:51,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:51,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:32:51,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:32:51,592 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 05:32:51,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:32:51,592 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/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 05:32:51,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:32:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:32:51,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:32:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 05:32:51,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:32:51,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 8 [2018-12-02 05:32:51,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 05:32:51,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 05:32:51,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:32:51,654 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 8 states. [2018-12-02 05:32:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:32:51,699 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-12-02 05:32:51,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:32:51,700 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-12-02 05:32:51,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:32:51,700 INFO L225 Difference]: With dead ends: 101 [2018-12-02 05:32:51,700 INFO L226 Difference]: Without dead ends: 101 [2018-12-02 05:32:51,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:32:51,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-02 05:32:51,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-12-02 05:32:51,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 05:32:51,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2018-12-02 05:32:51,703 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 34 [2018-12-02 05:32:51,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:32:51,703 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2018-12-02 05:32:51,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 05:32:51,704 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2018-12-02 05:32:51,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 05:32:51,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:32:51,704 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:32:51,705 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:32:51,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:32:51,705 INFO L82 PathProgramCache]: Analyzing trace with hash -939056962, now seen corresponding path program 1 times [2018-12-02 05:32:51,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:32:51,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:32:51,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:51,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:32:51,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:32:51,780 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 05:32:51,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:32:51,780 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/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 05:32:51,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:32:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:32:51,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:32:51,835 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 05:32:51,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:32:51,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-02 05:32:51,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 05:32:51,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 05:32:51,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:32:51,861 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand 9 states. [2018-12-02 05:32:51,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:32:51,948 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2018-12-02 05:32:51,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:32:51,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-12-02 05:32:51,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:32:51,949 INFO L225 Difference]: With dead ends: 111 [2018-12-02 05:32:51,949 INFO L226 Difference]: Without dead ends: 111 [2018-12-02 05:32:51,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:32:51,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-02 05:32:51,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 103. [2018-12-02 05:32:51,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-02 05:32:51,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-12-02 05:32:51,952 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 35 [2018-12-02 05:32:51,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:32:51,952 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-12-02 05:32:51,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 05:32:51,952 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-12-02 05:32:51,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 05:32:51,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:32:51,953 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:32:51,953 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:32:51,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:32:51,953 INFO L82 PathProgramCache]: Analyzing trace with hash -939056963, now seen corresponding path program 1 times [2018-12-02 05:32:51,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:32:51,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:32:51,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:51,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:32:51,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:32:51,988 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 05:32:51,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:32:51,988 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/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 05:32:51,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:32:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:32:52,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:32:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 05:32:52,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:32:52,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-12-02 05:32:52,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:32:52,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:32:52,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:32:52,032 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 5 states. [2018-12-02 05:32:52,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:32:52,095 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-12-02 05:32:52,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:32:52,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-12-02 05:32:52,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:32:52,096 INFO L225 Difference]: With dead ends: 104 [2018-12-02 05:32:52,096 INFO L226 Difference]: Without dead ends: 104 [2018-12-02 05:32:52,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:32:52,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-02 05:32:52,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-12-02 05:32:52,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-02 05:32:52,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2018-12-02 05:32:52,098 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 35 [2018-12-02 05:32:52,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:32:52,099 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2018-12-02 05:32:52,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:32:52,099 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2018-12-02 05:32:52,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 05:32:52,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:32:52,099 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:32:52,099 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:32:52,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:32:52,100 INFO L82 PathProgramCache]: Analyzing trace with hash 954005222, now seen corresponding path program 1 times [2018-12-02 05:32:52,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:32:52,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:32:52,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:52,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:32:52,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:32:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 05:32:52,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:32:52,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:32:52,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:32:52,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:32:52,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:32:52,130 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand 7 states. [2018-12-02 05:32:52,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:32:52,221 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-12-02 05:32:52,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:32:52,221 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-12-02 05:32:52,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:32:52,221 INFO L225 Difference]: With dead ends: 103 [2018-12-02 05:32:52,221 INFO L226 Difference]: Without dead ends: 103 [2018-12-02 05:32:52,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:32:52,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-02 05:32:52,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-12-02 05:32:52,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-02 05:32:52,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-12-02 05:32:52,224 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 36 [2018-12-02 05:32:52,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:32:52,224 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-12-02 05:32:52,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:32:52,224 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-12-02 05:32:52,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 05:32:52,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:32:52,224 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:32:52,224 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:32:52,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:32:52,225 INFO L82 PathProgramCache]: Analyzing trace with hash 954005223, now seen corresponding path program 1 times [2018-12-02 05:32:52,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:32:52,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:32:52,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:52,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:32:52,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:32:52,269 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 05:32:52,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:32:52,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:32:52,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:32:52,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:32:52,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:32:52,269 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 7 states. [2018-12-02 05:32:52,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:32:52,367 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-12-02 05:32:52,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:32:52,368 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-12-02 05:32:52,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:32:52,368 INFO L225 Difference]: With dead ends: 101 [2018-12-02 05:32:52,368 INFO L226 Difference]: Without dead ends: 101 [2018-12-02 05:32:52,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:32:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-02 05:32:52,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-02 05:32:52,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-02 05:32:52,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2018-12-02 05:32:52,372 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 36 [2018-12-02 05:32:52,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:32:52,372 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2018-12-02 05:32:52,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:32:52,372 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2018-12-02 05:32:52,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 05:32:52,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:32:52,373 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:32:52,373 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:32:52,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:32:52,373 INFO L82 PathProgramCache]: Analyzing trace with hash 208022194, now seen corresponding path program 1 times [2018-12-02 05:32:52,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:32:52,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:32:52,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:52,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:32:52,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:32:52,474 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 05:32:52,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:32:52,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 05:32:52,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:32:52,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:32:52,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:32:52,475 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand 12 states. [2018-12-02 05:32:52,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:32:52,744 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2018-12-02 05:32:52,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:32:52,744 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-12-02 05:32:52,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:32:52,745 INFO L225 Difference]: With dead ends: 107 [2018-12-02 05:32:52,745 INFO L226 Difference]: Without dead ends: 107 [2018-12-02 05:32:52,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-02 05:32:52,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-02 05:32:52,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-12-02 05:32:52,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 05:32:52,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2018-12-02 05:32:52,748 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 45 [2018-12-02 05:32:52,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:32:52,749 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2018-12-02 05:32:52,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:32:52,749 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2018-12-02 05:32:52,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 05:32:52,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:32:52,750 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:32:52,750 INFO L423 AbstractCegarLoop]: === Iteration 14 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:32:52,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:32:52,750 INFO L82 PathProgramCache]: Analyzing trace with hash 208022195, now seen corresponding path program 1 times [2018-12-02 05:32:52,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:32:52,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:32:52,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:52,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:32:52,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:32:52,786 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 05:32:52,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:32:52,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:32:52,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:32:52,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:32:52,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:32:52,787 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand 6 states. [2018-12-02 05:32:52,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:32:52,831 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2018-12-02 05:32:52,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:32:52,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-12-02 05:32:52,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:32:52,832 INFO L225 Difference]: With dead ends: 125 [2018-12-02 05:32:52,832 INFO L226 Difference]: Without dead ends: 125 [2018-12-02 05:32:52,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:32:52,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-02 05:32:52,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 116. [2018-12-02 05:32:52,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-02 05:32:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2018-12-02 05:32:52,835 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 45 [2018-12-02 05:32:52,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:32:52,835 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2018-12-02 05:32:52,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:32:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2018-12-02 05:32:52,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 05:32:52,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:32:52,836 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:32:52,836 INFO L423 AbstractCegarLoop]: === Iteration 15 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:32:52,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:32:52,836 INFO L82 PathProgramCache]: Analyzing trace with hash 208022250, now seen corresponding path program 1 times [2018-12-02 05:32:52,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:32:52,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:32:52,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:52,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:32:52,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:32:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 05:32:52,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:32:52,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 05:32:52,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:32:52,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:32:52,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:32:52,950 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. Second operand 12 states. [2018-12-02 05:32:53,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:32:53,149 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2018-12-02 05:32:53,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:32:53,149 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-12-02 05:32:53,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:32:53,149 INFO L225 Difference]: With dead ends: 120 [2018-12-02 05:32:53,150 INFO L226 Difference]: Without dead ends: 120 [2018-12-02 05:32:53,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-02 05:32:53,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-02 05:32:53,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2018-12-02 05:32:53,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-02 05:32:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 132 transitions. [2018-12-02 05:32:53,153 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 132 transitions. Word has length 45 [2018-12-02 05:32:53,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:32:53,154 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 132 transitions. [2018-12-02 05:32:53,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:32:53,154 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 132 transitions. [2018-12-02 05:32:53,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 05:32:53,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:32:53,154 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:32:53,154 INFO L423 AbstractCegarLoop]: === Iteration 16 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:32:53,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:32:53,154 INFO L82 PathProgramCache]: Analyzing trace with hash 362970760, now seen corresponding path program 1 times [2018-12-02 05:32:53,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:32:53,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:32:53,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:53,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:32:53,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:32:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 05:32:53,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:32:53,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:32:53,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:32:53,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:32:53,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:32:53,184 INFO L87 Difference]: Start difference. First operand 116 states and 132 transitions. Second operand 6 states. [2018-12-02 05:32:53,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:32:53,204 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2018-12-02 05:32:53,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:32:53,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-12-02 05:32:53,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:32:53,205 INFO L225 Difference]: With dead ends: 104 [2018-12-02 05:32:53,205 INFO L226 Difference]: Without dead ends: 104 [2018-12-02 05:32:53,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:32:53,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-02 05:32:53,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-02 05:32:53,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 05:32:53,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-12-02 05:32:53,207 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 47 [2018-12-02 05:32:53,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:32:53,208 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-12-02 05:32:53,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:32:53,208 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-12-02 05:32:53,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 05:32:53,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:32:53,208 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:32:53,208 INFO L423 AbstractCegarLoop]: === Iteration 17 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:32:53,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:32:53,208 INFO L82 PathProgramCache]: Analyzing trace with hash -446967498, now seen corresponding path program 1 times [2018-12-02 05:32:53,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:32:53,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:32:53,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:53,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:32:53,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:32:53,440 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:32:53,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:32:53,441 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/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 05:32:53,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:32:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:32:53,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:32:53,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:32:53,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:32:53,516 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 05:32:53,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:32:53,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:32:53,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-02 05:32:53,558 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 05:32:53,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:32:53,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:32:53,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:32:53,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:32:53,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-02 05:32:53,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 05:32:53,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 05:32:53,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:32:53,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:32:53,599 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 05:32:53,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-02 05:32:53,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-02 05:32:53,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-12-02 05:32:53,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:32:53,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:32:53,679 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 05:32:53,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-12-02 05:32:55,711 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-12-02 05:32:55,717 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 48 treesize of output 40 [2018-12-02 05:32:55,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:32:55,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 50 [2018-12-02 05:32:55,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:32:55,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:32:55,729 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 05:32:55,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2018-12-02 05:32:55,918 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 51 treesize of output 35 [2018-12-02 05:32:55,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 05:32:55,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:32:55,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:32:55,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-12-02 05:32:55,926 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:32:55,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:32:55,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:32:55,934 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:5 [2018-12-02 05:32:55,949 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:32:55,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:32:55,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 36 [2018-12-02 05:32:55,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-02 05:32:55,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-02 05:32:55,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1242, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 05:32:55,965 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 37 states. [2018-12-02 05:32:57,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:32:57,001 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2018-12-02 05:32:57,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 05:32:57,002 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 48 [2018-12-02 05:32:57,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:32:57,002 INFO L225 Difference]: With dead ends: 129 [2018-12-02 05:32:57,002 INFO L226 Difference]: Without dead ends: 129 [2018-12-02 05:32:57,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=204, Invalid=2346, Unknown=0, NotChecked=0, Total=2550 [2018-12-02 05:32:57,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-02 05:32:57,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2018-12-02 05:32:57,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-02 05:32:57,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2018-12-02 05:32:57,005 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 48 [2018-12-02 05:32:57,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:32:57,005 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2018-12-02 05:32:57,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-02 05:32:57,005 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2018-12-02 05:32:57,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 05:32:57,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:32:57,006 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:32:57,006 INFO L423 AbstractCegarLoop]: === Iteration 18 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:32:57,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:32:57,006 INFO L82 PathProgramCache]: Analyzing trace with hash -446967497, now seen corresponding path program 1 times [2018-12-02 05:32:57,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:32:57,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:32:57,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:57,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:32:57,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:32:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:32:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:32:57,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:32:57,414 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/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 05:32:57,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:32:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:32:57,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:32:57,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:32:57,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 05:32:57,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:32:57,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:32:57,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:32:57,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 05:32:57,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:32:57,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:32:57,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-12-02 05:32:57,709 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 05:32:57,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 05:32:57,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:32:57,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:32:57,723 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 05:32:57,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:32:57,725 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:32:57,727 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:32:57,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:32:57,738 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2018-12-02 05:32:57,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 05:32:57,785 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 05:32:57,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:32:57,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:32:57,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 32 [2018-12-02 05:32:57,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-02 05:32:57,806 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:32:57,810 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:32:57,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:32:57,820 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:65 [2018-12-02 05:32:57,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 64 [2018-12-02 05:32:57,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:32:57,923 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 44 treesize of output 57 [2018-12-02 05:32:57,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:32:57,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:32:57,963 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 38 treesize of output 54 [2018-12-02 05:32:57,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:32:57,966 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 31 [2018-12-02 05:32:57,966 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:32:57,972 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:32:57,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:32:57,984 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:111, output treesize:95 [2018-12-02 05:32:58,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:32:58,044 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 127 treesize of output 105 [2018-12-02 05:32:58,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:32:58,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 137 [2018-12-02 05:32:58,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:32:58,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:32:58,082 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 55 treesize of output 75 [2018-12-02 05:32:58,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:32:58,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 43 [2018-12-02 05:32:58,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:32:58,092 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:32:58,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:32:58,107 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:146, output treesize:152 [2018-12-02 05:32:58,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:32:58,466 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 153 treesize of output 109 [2018-12-02 05:32:58,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:32:58,468 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 56 treesize of output 34 [2018-12-02 05:32:58,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:32:58,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:32:58,481 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 54 treesize of output 34 [2018-12-02 05:32:58,481 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:32:58,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:32:58,504 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 34 [2018-12-02 05:32:58,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:32:58,506 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 13 treesize of output 6 [2018-12-02 05:32:58,506 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:32:58,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:32:58,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-02 05:32:58,515 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 05:32:58,517 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:32:58,525 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 05:32:58,525 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:166, output treesize:23 [2018-12-02 05:32:58,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:32:58,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:32:58,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2018-12-02 05:32:58,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-02 05:32:58,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-02 05:32:58,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1862, Unknown=0, NotChecked=0, Total=1980 [2018-12-02 05:32:58,635 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand 45 states. [2018-12-02 05:33:01,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:33:01,034 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2018-12-02 05:33:01,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 05:33:01,035 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 48 [2018-12-02 05:33:01,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:33:01,035 INFO L225 Difference]: With dead ends: 130 [2018-12-02 05:33:01,035 INFO L226 Difference]: Without dead ends: 130 [2018-12-02 05:33:01,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=258, Invalid=3402, Unknown=0, NotChecked=0, Total=3660 [2018-12-02 05:33:01,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-02 05:33:01,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 108. [2018-12-02 05:33:01,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-02 05:33:01,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2018-12-02 05:33:01,038 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 48 [2018-12-02 05:33:01,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:33:01,038 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2018-12-02 05:33:01,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-02 05:33:01,038 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2018-12-02 05:33:01,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 05:33:01,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:33:01,039 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:33:01,039 INFO L423 AbstractCegarLoop]: === Iteration 19 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:33:01,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:33:01,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1208456142, now seen corresponding path program 2 times [2018-12-02 05:33:01,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:33:01,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:33:01,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:33:01,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:33:01,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:33:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:33:01,072 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 05:33:01,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:33:01,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:33:01,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:33:01,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:33:01,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:33:01,080 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 7 states. [2018-12-02 05:33:01,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:33:01,115 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2018-12-02 05:33:01,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:33:01,116 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-12-02 05:33:01,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:33:01,117 INFO L225 Difference]: With dead ends: 100 [2018-12-02 05:33:01,117 INFO L226 Difference]: Without dead ends: 100 [2018-12-02 05:33:01,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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 05:33:01,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-02 05:33:01,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-02 05:33:01,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 05:33:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-12-02 05:33:01,119 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 51 [2018-12-02 05:33:01,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:33:01,120 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-12-02 05:33:01,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:33:01,120 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-12-02 05:33:01,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 05:33:01,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:33:01,120 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:33:01,121 INFO L423 AbstractCegarLoop]: === Iteration 20 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:33:01,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:33:01,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1664125494, now seen corresponding path program 1 times [2018-12-02 05:33:01,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:33:01,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:33:01,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:33:01,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:33:01,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:33:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:33:01,191 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 05:33:01,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:33:01,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 05:33:01,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:33:01,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:33:01,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:33:01,192 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 12 states. [2018-12-02 05:33:01,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:33:01,378 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2018-12-02 05:33:01,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:33:01,378 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-12-02 05:33:01,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:33:01,378 INFO L225 Difference]: With dead ends: 105 [2018-12-02 05:33:01,378 INFO L226 Difference]: Without dead ends: 105 [2018-12-02 05:33:01,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 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 05:33:01,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-02 05:33:01,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-12-02 05:33:01,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-02 05:33:01,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2018-12-02 05:33:01,380 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 58 [2018-12-02 05:33:01,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:33:01,380 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2018-12-02 05:33:01,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:33:01,380 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2018-12-02 05:33:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 05:33:01,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:33:01,381 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:33:01,381 INFO L423 AbstractCegarLoop]: === Iteration 21 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:33:01,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:33:01,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1664125493, now seen corresponding path program 1 times [2018-12-02 05:33:01,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:33:01,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:33:01,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:33:01,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:33:01,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:33:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:33:01,404 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 05:33:01,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:33:01,404 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/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 05:33:01,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:33:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:33:01,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:33:01,439 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 05:33:01,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:33:01,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-12-02 05:33:01,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:33:01,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:33:01,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:33:01,455 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand 5 states. [2018-12-02 05:33:01,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:33:01,480 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2018-12-02 05:33:01,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:33:01,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-12-02 05:33:01,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:33:01,481 INFO L225 Difference]: With dead ends: 110 [2018-12-02 05:33:01,481 INFO L226 Difference]: Without dead ends: 110 [2018-12-02 05:33:01,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:33:01,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-02 05:33:01,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-02 05:33:01,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-02 05:33:01,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2018-12-02 05:33:01,485 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 58 [2018-12-02 05:33:01,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:33:01,485 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2018-12-02 05:33:01,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:33:01,485 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2018-12-02 05:33:01,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 05:33:01,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:33:01,485 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 05:33:01,486 INFO L423 AbstractCegarLoop]: === Iteration 22 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:33:01,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:33:01,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1612389058, now seen corresponding path program 1 times [2018-12-02 05:33:01,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:33:01,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:33:01,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:33:01,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:33:01,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:33:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:33:01,523 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 05:33:01,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:33:01,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:33:01,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:33:01,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:33:01,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:33:01,524 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 7 states. [2018-12-02 05:33:01,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:33:01,564 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-12-02 05:33:01,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:33:01,564 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2018-12-02 05:33:01,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:33:01,565 INFO L225 Difference]: With dead ends: 104 [2018-12-02 05:33:01,565 INFO L226 Difference]: Without dead ends: 104 [2018-12-02 05:33:01,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:33:01,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-02 05:33:01,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-02 05:33:01,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 05:33:01,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2018-12-02 05:33:01,568 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 59 [2018-12-02 05:33:01,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:33:01,568 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2018-12-02 05:33:01,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:33:01,568 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2018-12-02 05:33:01,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 05:33:01,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:33:01,568 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:33:01,569 INFO L423 AbstractCegarLoop]: === Iteration 23 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:33:01,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:33:01,569 INFO L82 PathProgramCache]: Analyzing trace with hash -2144929985, now seen corresponding path program 2 times [2018-12-02 05:33:01,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:33:01,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:33:01,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:33:01,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:33:01,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:33:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:33:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 05:33:01,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:33:01,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:33:01,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:33:01,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:33:01,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:33:01,594 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 6 states. [2018-12-02 05:33:01,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:33:01,623 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2018-12-02 05:33:01,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:33:01,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-02 05:33:01,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:33:01,624 INFO L225 Difference]: With dead ends: 118 [2018-12-02 05:33:01,624 INFO L226 Difference]: Without dead ends: 118 [2018-12-02 05:33:01,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:33:01,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-02 05:33:01,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2018-12-02 05:33:01,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-02 05:33:01,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2018-12-02 05:33:01,626 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 66 [2018-12-02 05:33:01,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:33:01,626 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2018-12-02 05:33:01,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:33:01,626 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2018-12-02 05:33:01,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 05:33:01,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:33:01,626 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:33:01,626 INFO L423 AbstractCegarLoop]: === Iteration 24 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:33:01,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:33:01,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2144929930, now seen corresponding path program 1 times [2018-12-02 05:33:01,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:33:01,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:33:01,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:33:01,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:33:01,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:33:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:33:01,728 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-02 05:33:01,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:33:01,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 05:33:01,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:33:01,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:33:01,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:33:01,729 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand 12 states. [2018-12-02 05:33:01,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:33:01,943 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2018-12-02 05:33:01,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:33:01,943 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-12-02 05:33:01,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:33:01,943 INFO L225 Difference]: With dead ends: 119 [2018-12-02 05:33:01,943 INFO L226 Difference]: Without dead ends: 119 [2018-12-02 05:33:01,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-02 05:33:01,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-02 05:33:01,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2018-12-02 05:33:01,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-02 05:33:01,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2018-12-02 05:33:01,945 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 66 [2018-12-02 05:33:01,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:33:01,946 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2018-12-02 05:33:01,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:33:01,946 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2018-12-02 05:33:01,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 05:33:01,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:33:01,946 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:33:01,946 INFO L423 AbstractCegarLoop]: === Iteration 25 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:33:01,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:33:01,946 INFO L82 PathProgramCache]: Analyzing trace with hash 915903942, now seen corresponding path program 1 times [2018-12-02 05:33:01,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:33:01,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:33:01,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:33:01,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:33:01,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:33:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:33:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 05:33:02,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:33:02,418 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/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 05:33:02,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:33:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:33:02,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:33:02,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:02,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:02,507 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 05:33:02,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:33:02,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:33:02,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-02 05:33:02,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 11 treesize of output 8 [2018-12-02 05:33:02,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 05:33:02,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:33:02,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:33:02,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:33:02,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-02 05:33:02,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 05:33:02,582 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 05:33:02,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:33:02,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:33:02,588 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 05:33:02,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-02 05:33:02,647 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 28 treesize of output 27 [2018-12-02 05:33:02,649 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 17 [2018-12-02 05:33:02,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:33:02,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:33:02,657 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 05:33:02,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-12-02 05:33:02,691 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 39 treesize of output 33 [2018-12-02 05:33:02,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:02,693 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 41 [2018-12-02 05:33:02,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:33:02,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:33:02,700 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 05:33:02,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-12-02 05:33:03,599 WARN L180 SmtUtils]: Spent 663.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-02 05:33:03,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2018-12-02 05:33:03,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2018-12-02 05:33:03,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 05:33:03,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 05:33:03,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 05:33:03,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:78 [2018-12-02 05:33:03,684 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 23 [2018-12-02 05:33:03,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:03,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-02 05:33:03,687 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 05:33:03,691 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 05:33:03,695 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 05:33:03,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2018-12-02 05:33:11,801 WARN L180 SmtUtils]: Spent 458.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-02 05:33:11,806 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 50 treesize of output 39 [2018-12-02 05:33:11,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:11,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:11,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:11,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 51 [2018-12-02 05:33:11,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:33:11,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:33:11,829 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 05:33:11,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:36 [2018-12-02 05:33:11,930 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 38 treesize of output 28 [2018-12-02 05:33:11,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:11,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-12-02 05:33:11,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:33:11,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:33:11,937 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 05:33:11,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2018-12-02 05:33:11,959 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 05:33:11,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:33:11,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 50 [2018-12-02 05:33:11,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-02 05:33:11,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-02 05:33:11,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2390, Unknown=17, NotChecked=0, Total=2550 [2018-12-02 05:33:11,975 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand 51 states. [2018-12-02 05:33:23,891 WARN L180 SmtUtils]: Spent 685.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-02 05:33:26,597 WARN L180 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-02 05:33:29,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:33:29,953 INFO L93 Difference]: Finished difference Result 146 states and 161 transitions. [2018-12-02 05:33:29,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-02 05:33:29,953 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 69 [2018-12-02 05:33:29,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:33:29,954 INFO L225 Difference]: With dead ends: 146 [2018-12-02 05:33:29,954 INFO L226 Difference]: Without dead ends: 146 [2018-12-02 05:33:29,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 42 SyntacticMatches, 10 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=416, Invalid=5267, Unknown=17, NotChecked=0, Total=5700 [2018-12-02 05:33:29,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-02 05:33:29,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2018-12-02 05:33:29,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-02 05:33:29,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 139 transitions. [2018-12-02 05:33:29,956 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 139 transitions. Word has length 69 [2018-12-02 05:33:29,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:33:29,957 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 139 transitions. [2018-12-02 05:33:29,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-02 05:33:29,957 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 139 transitions. [2018-12-02 05:33:29,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 05:33:29,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:33:29,958 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:33:29,958 INFO L423 AbstractCegarLoop]: === Iteration 26 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:33:29,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:33:29,958 INFO L82 PathProgramCache]: Analyzing trace with hash 915903943, now seen corresponding path program 1 times [2018-12-02 05:33:29,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:33:29,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:33:29,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:33:29,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:33:29,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:33:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:33:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:33:30,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:33:30,569 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/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 05:33:30,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:33:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:33:30,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:33:30,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:30,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:30,676 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 05:33:30,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:33:30,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:33:30,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-02 05:33:30,734 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 05:33:30,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 05:33:30,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:33:30,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:33:30,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:33:30,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-02 05:33:30,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 05:33:30,778 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 05:33:30,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:33:30,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:33:30,786 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 05:33:30,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-02 05:33:30,850 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 28 treesize of output 27 [2018-12-02 05:33:30,852 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 17 [2018-12-02 05:33:30,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:33:30,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:33:30,864 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 05:33:30,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-12-02 05:33:32,898 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-02 05:33:32,907 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 50 treesize of output 40 [2018-12-02 05:33:32,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:32,910 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 39 treesize of output 52 [2018-12-02 05:33:32,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:33:32,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:33:32,923 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 05:33:32,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:33:32,925 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:33:32,926 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:33:32,931 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 05:33:32,931 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:52 [2018-12-02 05:33:34,986 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-02 05:33:37,033 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-02 05:33:39,079 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-02 05:33:41,130 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-02 05:33:41,303 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 120 treesize of output 123 [2018-12-02 05:33:41,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-02 05:33:41,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:33:41,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:33:41,326 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 106 treesize of output 92 [2018-12-02 05:33:41,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 96 [2018-12-02 05:33:41,342 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-12-02 05:33:41,367 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-02 05:33:41,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-02 05:33:41,408 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:154, output treesize:283 [2018-12-02 05:33:41,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2018-12-02 05:33:41,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:41,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:41,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 32 [2018-12-02 05:33:41,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:33:41,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:33:41,556 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 71 treesize of output 65 [2018-12-02 05:33:41,558 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:41,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2018-12-02 05:33:41,560 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 05:33:41,568 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 05:33:41,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:41,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2018-12-02 05:33:41,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:41,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-12-02 05:33:41,587 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 05:33:41,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 05:33:41,599 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 05:33:41,602 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:33:41,614 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 37 treesize of output 29 [2018-12-02 05:33:41,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:41,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-02 05:33:41,617 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:33:41,621 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:33:41,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 05:33:41,630 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:139, output treesize:25 [2018-12-02 05:33:42,394 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 Int)) (<= 4 (select |c_#length| v_arrayElimCell_44))) (exists ((dll_circular_update_at_~head.offset Int)) (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_dll_circular_update_at_#in~head.base|) .cse0)))) (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))))) is different from true [2018-12-02 05:33:42,402 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 107 treesize of output 96 [2018-12-02 05:33:42,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:42,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:42,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:42,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 57 [2018-12-02 05:33:42,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:33:42,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:33:42,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 102 [2018-12-02 05:33:42,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:42,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:42,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:42,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 64 [2018-12-02 05:33:42,473 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:33:42,487 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:33:42,519 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 88 treesize of output 77 [2018-12-02 05:33:42,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:42,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:42,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:42,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:42,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 74 [2018-12-02 05:33:42,526 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 05:33:42,537 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:33:42,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:42,566 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 92 treesize of output 88 [2018-12-02 05:33:42,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:42,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:42,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:42,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 84 [2018-12-02 05:33:42,572 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 05:33:42,583 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:33:42,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 05:33:42,614 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:219, output treesize:135 [2018-12-02 05:33:42,821 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 75 treesize of output 65 [2018-12-02 05:33:42,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:42,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2018-12-02 05:33:42,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:33:42,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:33:42,851 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 47 treesize of output 37 [2018-12-02 05:33:42,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:42,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:42,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-12-02 05:33:42,854 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:33:42,859 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:33:42,872 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 71 [2018-12-02 05:33:42,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:42,874 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 43 treesize of output 36 [2018-12-02 05:33:42,875 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 05:33:42,882 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 05:33:42,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:42,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 53 [2018-12-02 05:33:42,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:33:42,897 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 38 treesize of output 18 [2018-12-02 05:33:42,897 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 05:33:42,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 05:33:42,902 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 05:33:42,904 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:33:42,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:33:42,914 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:155, output treesize:13 [2018-12-02 05:33:42,926 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-12-02 05:33:42,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:33:42,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 53 [2018-12-02 05:33:42,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-02 05:33:42,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-02 05:33:42,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2615, Unknown=1, NotChecked=102, Total=2862 [2018-12-02 05:33:42,942 INFO L87 Difference]: Start difference. First operand 122 states and 139 transitions. Second operand 54 states. [2018-12-02 05:33:47,516 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-02 05:33:51,608 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2018-12-02 05:33:59,716 WARN L180 SmtUtils]: Spent 8.05 s on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2018-12-02 05:34:03,772 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-12-02 05:34:07,826 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-12-02 05:34:14,200 WARN L180 SmtUtils]: Spent 5.74 s on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2018-12-02 05:34:15,119 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2018-12-02 05:34:16,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:34:16,020 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2018-12-02 05:34:16,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-02 05:34:16,021 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 69 [2018-12-02 05:34:16,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:34:16,021 INFO L225 Difference]: With dead ends: 143 [2018-12-02 05:34:16,022 INFO L226 Difference]: Without dead ends: 143 [2018-12-02 05:34:16,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 43.4s TimeCoverageRelationStatistics Valid=398, Invalid=5767, Unknown=1, NotChecked=154, Total=6320 [2018-12-02 05:34:16,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-02 05:34:16,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 121. [2018-12-02 05:34:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-02 05:34:16,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2018-12-02 05:34:16,025 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 69 [2018-12-02 05:34:16,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:34:16,025 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2018-12-02 05:34:16,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-02 05:34:16,026 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2018-12-02 05:34:16,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 05:34:16,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:34:16,026 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:34:16,026 INFO L423 AbstractCegarLoop]: === Iteration 27 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:34:16,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:34:16,027 INFO L82 PathProgramCache]: Analyzing trace with hash 915903998, now seen corresponding path program 1 times [2018-12-02 05:34:16,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:34:16,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:34:16,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:34:16,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:34:16,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:34:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:34:16,058 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 05:34:16,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:34:16,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:34:16,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:34:16,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:34:16,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:34:16,059 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand 7 states. [2018-12-02 05:34:16,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:34:16,088 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-12-02 05:34:16,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:34:16,088 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-12-02 05:34:16,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:34:16,089 INFO L225 Difference]: With dead ends: 107 [2018-12-02 05:34:16,089 INFO L226 Difference]: Without dead ends: 107 [2018-12-02 05:34:16,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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 05:34:16,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-02 05:34:16,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-02 05:34:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-02 05:34:16,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-12-02 05:34:16,091 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 69 [2018-12-02 05:34:16,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:34:16,091 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-12-02 05:34:16,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:34:16,092 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-12-02 05:34:16,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 05:34:16,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:34:16,092 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:34:16,092 INFO L423 AbstractCegarLoop]: === Iteration 28 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:34:16,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:34:16,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1144526287, now seen corresponding path program 1 times [2018-12-02 05:34:16,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:34:16,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:34:16,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:34:16,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:34:16,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:34:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:34:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-02 05:34:16,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:34:16,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 05:34:16,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:34:16,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:34:16,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:34:16,163 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 12 states. [2018-12-02 05:34:16,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:34:16,342 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2018-12-02 05:34:16,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:34:16,342 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2018-12-02 05:34:16,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:34:16,343 INFO L225 Difference]: With dead ends: 123 [2018-12-02 05:34:16,343 INFO L226 Difference]: Without dead ends: 123 [2018-12-02 05:34:16,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 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 05:34:16,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-02 05:34:16,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2018-12-02 05:34:16,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-02 05:34:16,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-12-02 05:34:16,345 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 91 [2018-12-02 05:34:16,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:34:16,345 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-12-02 05:34:16,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:34:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-12-02 05:34:16,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 05:34:16,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:34:16,346 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:34:16,346 INFO L423 AbstractCegarLoop]: === Iteration 29 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:34:16,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:34:16,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1144526288, now seen corresponding path program 1 times [2018-12-02 05:34:16,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:34:16,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:34:16,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:34:16,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:34:16,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:34:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:34:16,454 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-02 05:34:16,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:34:16,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 05:34:16,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:34:16,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:34:16,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:34:16,455 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 12 states. [2018-12-02 05:34:16,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:34:16,668 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-12-02 05:34:16,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:34:16,668 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2018-12-02 05:34:16,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:34:16,669 INFO L225 Difference]: With dead ends: 107 [2018-12-02 05:34:16,669 INFO L226 Difference]: Without dead ends: 107 [2018-12-02 05:34:16,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-02 05:34:16,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-02 05:34:16,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-02 05:34:16,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-02 05:34:16,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-12-02 05:34:16,671 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 91 [2018-12-02 05:34:16,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:34:16,671 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-12-02 05:34:16,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:34:16,671 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-12-02 05:34:16,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 05:34:16,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:34:16,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:34:16,672 INFO L423 AbstractCegarLoop]: === Iteration 30 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:34:16,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:34:16,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1133944862, now seen corresponding path program 1 times [2018-12-02 05:34:16,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:34:16,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:34:16,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:34:16,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:34:16,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:34:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:34:16,739 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-02 05:34:16,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:34:16,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 05:34:16,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:34:16,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:34:16,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:34:16,740 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 12 states. [2018-12-02 05:34:16,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:34:16,846 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-12-02 05:34:16,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:34:16,846 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-12-02 05:34:16,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:34:16,847 INFO L225 Difference]: With dead ends: 109 [2018-12-02 05:34:16,847 INFO L226 Difference]: Without dead ends: 107 [2018-12-02 05:34:16,847 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 05:34:16,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-02 05:34:16,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-02 05:34:16,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-02 05:34:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-12-02 05:34:16,850 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 94 [2018-12-02 05:34:16,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:34:16,850 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-12-02 05:34:16,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:34:16,850 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-12-02 05:34:16,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 05:34:16,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:34:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:34:16,851 INFO L423 AbstractCegarLoop]: === Iteration 31 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:34:16,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:34:16,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1162618541, now seen corresponding path program 1 times [2018-12-02 05:34:16,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:34:16,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:34:16,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:34:16,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:34:16,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:34:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:34:16,934 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 05:34:16,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:34:16,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/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 05:34:16,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:34:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:34:16,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:34:17,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 17 treesize of output 13 [2018-12-02 05:34:17,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-02 05:34:17,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:34:17,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:17,030 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 05:34:17,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-02 05:34:17,041 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 05:34:17,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:34:17,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 11 [2018-12-02 05:34:17,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:34:17,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:34:17,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:34:17,057 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 12 states. [2018-12-02 05:34:17,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:34:17,227 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-12-02 05:34:17,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 05:34:17,228 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-12-02 05:34:17,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:34:17,228 INFO L225 Difference]: With dead ends: 116 [2018-12-02 05:34:17,228 INFO L226 Difference]: Without dead ends: 116 [2018-12-02 05:34:17,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-12-02 05:34:17,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-02 05:34:17,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2018-12-02 05:34:17,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-02 05:34:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-12-02 05:34:17,230 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 94 [2018-12-02 05:34:17,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:34:17,230 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-12-02 05:34:17,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:34:17,230 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-12-02 05:34:17,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 05:34:17,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:34:17,231 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:34:17,231 INFO L423 AbstractCegarLoop]: === Iteration 32 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:34:17,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:34:17,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1162618540, now seen corresponding path program 1 times [2018-12-02 05:34:17,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:34:17,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:34:17,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:34:17,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:34:17,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:34:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:34:18,085 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 05:34:18,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:34:18,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/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 05:34:18,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:34:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:34:18,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:34:18,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:34:18,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:34:18,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, 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 05:34:18,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:34:18,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:18,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-12-02 05:34:18,284 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 05:34:18,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:34:18,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:34:18,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:18,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 05:34:18,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 05:34:18,297 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:34:18,299 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:18,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:18,306 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-12-02 05:34:18,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-12-02 05:34:18,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 05:34:18,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:34:18,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:18,364 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 05:34:18,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 05:34:18,366 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:34:18,370 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:18,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:18,377 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-12-02 05:34:18,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:34:18,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2018-12-02 05:34:18,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:34:18,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 46 [2018-12-02 05:34:18,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:34:18,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:18,482 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 34 treesize of output 48 [2018-12-02 05:34:18,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:34:18,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-02 05:34:18,485 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:34:18,489 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:18,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:18,498 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:69 [2018-12-02 05:34:18,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:34:18,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:34:18,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:34:18,556 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 96 [2018-12-02 05:34:18,559 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:34:18,567 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 140 [2018-12-02 05:34:18,567 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 05:34:18,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:18,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:34:18,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 77 [2018-12-02 05:34:18,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:34:18,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-12-02 05:34:18,607 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:34:18,613 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:18,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:18,622 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:109, output treesize:109 [2018-12-02 05:34:19,596 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_$Pointer$.offset)| .cse0 (let ((.cse1 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))))) |c_#memory_$Pointer$.offset|)) is different from true [2018-12-02 05:34:19,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:34:19,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:34:19,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 94 [2018-12-02 05:34:19,614 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 70 [2018-12-02 05:34:19,616 INFO L267 ElimStorePlain]: Start of recursive call 3: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-12-02 05:34:19,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 68 [2018-12-02 05:34:19,713 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 05:34:19,714 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 66 treesize of output 52 [2018-12-02 05:34:19,714 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:34:19,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 72 [2018-12-02 05:34:19,725 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-02 05:34:19,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:34:19,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 72 [2018-12-02 05:34:19,733 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-02 05:34:19,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-02 05:34:19,936 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 52 treesize of output 45 [2018-12-02 05:34:19,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 27 [2018-12-02 05:34:19,950 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-12-02 05:34:19,966 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 05:34:19,970 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 52 treesize of output 45 [2018-12-02 05:34:19,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 27 [2018-12-02 05:34:19,984 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-12-02 05:34:20,001 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 05:34:20,005 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 52 treesize of output 49 [2018-12-02 05:34:20,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 27 [2018-12-02 05:34:20,019 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-12-02 05:34:20,037 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 05:34:20,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2018-12-02 05:34:20,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 27 [2018-12-02 05:34:20,055 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-12-02 05:34:20,074 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 05:34:20,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 12 xjuncts. [2018-12-02 05:34:20,168 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 3 variables, input treesize:132, output treesize:377 [2018-12-02 05:34:20,806 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base| (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_dll_circular_update_at_#in~head.base|) .cse0))))) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))) is different from true [2018-12-02 05:34:20,815 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 51 treesize of output 44 [2018-12-02 05:34:20,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:34:20,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:34:20,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2018-12-02 05:34:20,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:34:20,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:20,848 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 51 treesize of output 48 [2018-12-02 05:34:20,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:34:20,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:34:20,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2018-12-02 05:34:20,853 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:34:20,860 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:20,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 05:34:20,882 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:103, output treesize:59 [2018-12-02 05:34:21,989 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 55 treesize of output 51 [2018-12-02 05:34:21,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-12-02 05:34:21,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:34:21,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:22,018 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 44 treesize of output 34 [2018-12-02 05:34:22,020 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 25 treesize of output 11 [2018-12-02 05:34:22,020 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:34:22,023 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:22,036 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 55 treesize of output 49 [2018-12-02 05:34:22,037 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 29 treesize of output 15 [2018-12-02 05:34:22,038 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 05:34:22,042 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:22,050 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 26 treesize of output 22 [2018-12-02 05:34:22,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-02 05:34:22,052 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 05:34:22,054 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:22,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:22,062 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:111, output treesize:11 [2018-12-02 05:34:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2018-12-02 05:34:22,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:34:22,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 40] total 65 [2018-12-02 05:34:22,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-02 05:34:22,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-02 05:34:22,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=3821, Unknown=2, NotChecked=250, Total=4290 [2018-12-02 05:34:22,114 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 66 states. [2018-12-02 05:34:23,059 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2018-12-02 05:34:25,213 WARN L180 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2018-12-02 05:34:26,253 WARN L180 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2018-12-02 05:34:26,612 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2018-12-02 05:34:28,327 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 108 DAG size of output: 71 [2018-12-02 05:34:29,659 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-12-02 05:34:29,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:34:29,839 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-12-02 05:34:29,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-02 05:34:29,840 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 94 [2018-12-02 05:34:29,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:34:29,841 INFO L225 Difference]: With dead ends: 116 [2018-12-02 05:34:29,841 INFO L226 Difference]: Without dead ends: 116 [2018-12-02 05:34:29,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 64 SyntacticMatches, 10 SemanticMatches, 93 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2117 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=617, Invalid=7945, Unknown=2, NotChecked=366, Total=8930 [2018-12-02 05:34:29,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-02 05:34:29,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2018-12-02 05:34:29,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-02 05:34:29,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2018-12-02 05:34:29,845 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 94 [2018-12-02 05:34:29,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:34:29,845 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2018-12-02 05:34:29,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-02 05:34:29,845 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2018-12-02 05:34:29,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 05:34:29,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:34:29,846 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:34:29,846 INFO L423 AbstractCegarLoop]: === Iteration 33 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:34:29,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:34:29,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1982742195, now seen corresponding path program 1 times [2018-12-02 05:34:29,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:34:29,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:34:29,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:34:29,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:34:29,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:34:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:34:30,324 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 05:34:30,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:34:30,324 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/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 05:34:30,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:34:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:34:30,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:34:30,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:34:30,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:34:30,422 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 05:34:30,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:34:30,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:30,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-12-02 05:34:30,470 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 05:34:30,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 05:34:30,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:34:30,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:30,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:30,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-02 05:34:30,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 05:34:30,502 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 05:34:30,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:34:30,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:30,509 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 05:34:30,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-12-02 05:34:30,567 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 28 treesize of output 27 [2018-12-02 05:34:30,569 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 17 [2018-12-02 05:34:30,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:34:30,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:30,577 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 05:34:30,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2018-12-02 05:34:30,606 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 39 treesize of output 33 [2018-12-02 05:34:30,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:34:30,608 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 41 [2018-12-02 05:34:30,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:34:30,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:30,616 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 05:34:30,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-12-02 05:34:31,304 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_$Pointer$.base)| .cse0 (let ((.cse1 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))))))) is different from true [2018-12-02 05:34:31,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:34:31,308 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:34:31,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 73 [2018-12-02 05:34:31,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 45 [2018-12-02 05:34:31,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 05:34:31,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 05:34:31,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 05:34:31,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:60 [2018-12-02 05:34:31,834 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0)))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))) is different from true [2018-12-02 05:34:31,838 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 39 treesize of output 30 [2018-12-02 05:34:31,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:34:31,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:34:31,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2018-12-02 05:34:31,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:34:31,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:34:31,850 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 05:34:31,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:23 [2018-12-02 05:34:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 2 not checked. [2018-12-02 05:34:44,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:34:44,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 56 [2018-12-02 05:34:44,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-02 05:34:44,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-02 05:34:44,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2691, Unknown=2, NotChecked=210, Total=3080 [2018-12-02 05:34:44,290 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 56 states. [2018-12-02 05:35:06,514 WARN L180 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2018-12-02 05:35:14,376 WARN L180 SmtUtils]: Spent 981.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 20 [2018-12-02 05:35:17,196 WARN L180 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-12-02 05:35:17,572 WARN L180 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-12-02 05:35:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:35:17,756 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-12-02 05:35:17,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-02 05:35:17,756 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 99 [2018-12-02 05:35:17,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:35:17,756 INFO L225 Difference]: With dead ends: 112 [2018-12-02 05:35:17,756 INFO L226 Difference]: Without dead ends: 108 [2018-12-02 05:35:17,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 70 SyntacticMatches, 12 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1434 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=434, Invalid=5269, Unknown=5, NotChecked=298, Total=6006 [2018-12-02 05:35:17,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-02 05:35:17,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-12-02 05:35:17,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-02 05:35:17,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-12-02 05:35:17,759 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 99 [2018-12-02 05:35:17,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:35:17,759 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-12-02 05:35:17,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-02 05:35:17,759 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-12-02 05:35:17,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 05:35:17,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:35:17,760 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:35:17,760 INFO L423 AbstractCegarLoop]: === Iteration 34 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:35:17,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:35:17,760 INFO L82 PathProgramCache]: Analyzing trace with hash -561858850, now seen corresponding path program 1 times [2018-12-02 05:35:17,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:35:17,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:35:17,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:35:17,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:35:17,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:35:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:35:18,533 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-12-02 05:35:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 05:35:19,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:35:19,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/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 05:35:19,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:35:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:35:19,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:35:19,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:19,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:19,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 05:35:19,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:19,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:19,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-12-02 05:35:19,801 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 05:35:19,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:35:19,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:19,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:19,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:19,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-12-02 05:35:19,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 05:35:19,848 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 05:35:19,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:19,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:19,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:19,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-12-02 05:35:19,925 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 05:35:19,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:35:19,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:19,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:19,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:19,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-12-02 05:35:19,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:19,944 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 33 treesize of output 41 [2018-12-02 05:35:19,944 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:19,950 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:19,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:19,957 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:47 [2018-12-02 05:35:20,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:20,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2018-12-02 05:35:20,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 05:35:20,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:20,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:20,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:20,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:20,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:20,024 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 76 [2018-12-02 05:35:20,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:20,034 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 114 [2018-12-02 05:35:20,035 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 05:35:20,050 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:20,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:20,058 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:71 [2018-12-02 05:35:21,210 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|)) (.cse1 (+ dll_circular_update_at_~head.offset 8))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)))) (= (store |c_old(#memory_$Pointer$.offset)| .cse0 (store (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) |c_#memory_$Pointer$.offset|) (<= (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|) dll_circular_update_at_~head.offset)))) is different from true [2018-12-02 05:35:21,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:21,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:21,217 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:35:21,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:21,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:21,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 183 [2018-12-02 05:35:21,253 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 62 treesize of output 88 [2018-12-02 05:35:21,255 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 14 xjuncts. [2018-12-02 05:35:21,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 05:35:21,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:21,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:21,356 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:35:21,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:21,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 117 [2018-12-02 05:35:21,363 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:35:21,371 INFO L478 Elim1Store]: Elim1 applied some 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 3 case distinctions, treesize of input 67 treesize of output 83 [2018-12-02 05:35:21,372 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-02 05:35:21,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:21,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:21,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:21,396 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:35:21,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:21,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:21,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 138 [2018-12-02 05:35:21,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:21,413 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 104 [2018-12-02 05:35:21,414 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 05:35:21,434 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:21,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:21,437 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:35:21,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 117 [2018-12-02 05:35:21,449 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 61 treesize of output 43 [2018-12-02 05:35:21,450 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-02 05:35:21,470 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 05:35:21,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 05:35:21,506 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:164, output treesize:203 [2018-12-02 05:35:22,390 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_dll_circular_update_at_#in~head.base|) .cse0)))) (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset)))) is different from true [2018-12-02 05:35:22,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 111 [2018-12-02 05:35:22,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,404 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 24 treesize of output 18 [2018-12-02 05:35:22,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:22,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:22,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,549 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 98 [2018-12-02 05:35:22,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,568 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 115 [2018-12-02 05:35:22,568 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 05:35:22,597 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:22,680 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 95 treesize of output 88 [2018-12-02 05:35:22,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 53 [2018-12-02 05:35:22,687 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:22,703 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:22,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 97 [2018-12-02 05:35:22,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,786 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 93 [2018-12-02 05:35:22,787 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 05:35:22,808 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:22,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 137 [2018-12-02 05:35:22,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,871 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:35:22,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,889 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 159 [2018-12-02 05:35:22,890 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 05:35:22,928 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:22,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,983 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 95 treesize of output 127 [2018-12-02 05:35:22,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:22,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:23,003 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 122 [2018-12-02 05:35:23,003 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 05:35:23,026 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:23,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 05:35:23,060 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 9 variables, input treesize:326, output treesize:203 [2018-12-02 05:35:24,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:24,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:24,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 86 [2018-12-02 05:35:24,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:24,209 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 55 [2018-12-02 05:35:24,210 INFO L267 ElimStorePlain]: Start of recursive call 3: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-12-02 05:35:24,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:24,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 65 [2018-12-02 05:35:24,265 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-12-02 05:35:24,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 63 [2018-12-02 05:35:24,284 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-12-02 05:35:24,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:24,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 63 [2018-12-02 05:35:24,302 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2018-12-02 05:35:24,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 35 [2018-12-02 05:35:24,313 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-02 05:35:24,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 11 xjuncts. [2018-12-02 05:35:24,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:24,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:24,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-12-02 05:35:24,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:24,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:24,982 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 41 [2018-12-02 05:35:24,983 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 05:35:24,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 05:35:24,995 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:24,999 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:25,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 49 [2018-12-02 05:35:25,012 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2018-12-02 05:35:25,012 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-02 05:35:25,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-12-02 05:35:25,030 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:25,036 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:25,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-12-02 05:35:25,048 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2018-12-02 05:35:25,048 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-02 05:35:25,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-12-02 05:35:25,063 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:25,068 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:25,069 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 44 treesize of output 36 [2018-12-02 05:35:25,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,072 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 13 treesize of output 13 [2018-12-02 05:35:25,073 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:25,082 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 11 treesize of output 8 [2018-12-02 05:35:25,083 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-12-02 05:35:25,089 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 05:35:25,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-12-02 05:35:25,101 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2018-12-02 05:35:25,102 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-02 05:35:25,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-12-02 05:35:25,116 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:25,121 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:25,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 49 [2018-12-02 05:35:25,133 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2018-12-02 05:35:25,134 INFO L267 ElimStorePlain]: Start of recursive call 24: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-02 05:35:25,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-12-02 05:35:25,146 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:25,152 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:25,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-12-02 05:35:25,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,170 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 41 [2018-12-02 05:35:25,171 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 05:35:25,181 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 05:35:25,181 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:25,187 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:25,189 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 44 treesize of output 40 [2018-12-02 05:35:25,193 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 11 treesize of output 8 [2018-12-02 05:35:25,193 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-12-02 05:35:25,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,205 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 13 treesize of output 13 [2018-12-02 05:35:25,205 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:25,212 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 05:35:25,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 49 [2018-12-02 05:35:25,223 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2018-12-02 05:35:25,224 INFO L267 ElimStorePlain]: Start of recursive call 33: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-02 05:35:25,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-12-02 05:35:25,239 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:25,245 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:25,247 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 44 treesize of output 36 [2018-12-02 05:35:25,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,249 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 13 treesize of output 13 [2018-12-02 05:35:25,249 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:25,259 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 11 treesize of output 8 [2018-12-02 05:35:25,260 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-12-02 05:35:25,265 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 05:35:25,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-12-02 05:35:25,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 05:35:25,271 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-12-02 05:35:25,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:25,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 13 [2018-12-02 05:35:25,282 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:25,288 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 05:35:25,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-02 05:35:25,446 INFO L202 ElimStorePlain]: Needed 40 recursive calls to eliminate 6 variables, input treesize:299, output treesize:58 [2018-12-02 05:35:25,730 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 2 not checked. [2018-12-02 05:35:25,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:35:25,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 38] total 61 [2018-12-02 05:35:25,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-02 05:35:25,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-02 05:35:25,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3256, Unknown=3, NotChecked=230, Total=3660 [2018-12-02 05:35:25,747 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 61 states. [2018-12-02 05:35:27,599 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2018-12-02 05:35:28,144 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 66 [2018-12-02 05:35:30,834 WARN L180 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 62 DAG size of output: 32 [2018-12-02 05:35:32,702 WARN L180 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 59 DAG size of output: 28 [2018-12-02 05:35:33,965 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-02 05:35:34,211 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-02 05:35:34,422 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-12-02 05:35:34,749 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 105 [2018-12-02 05:35:35,034 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 105 [2018-12-02 05:35:35,332 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2018-12-02 05:35:36,006 WARN L180 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2018-12-02 05:35:36,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:35:36,080 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2018-12-02 05:35:36,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-02 05:35:36,081 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 99 [2018-12-02 05:35:36,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:35:36,081 INFO L225 Difference]: With dead ends: 101 [2018-12-02 05:35:36,081 INFO L226 Difference]: Without dead ends: 101 [2018-12-02 05:35:36,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 66 SyntacticMatches, 13 SemanticMatches, 85 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1424 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=484, Invalid=6661, Unknown=3, NotChecked=334, Total=7482 [2018-12-02 05:35:36,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-02 05:35:36,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-02 05:35:36,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-02 05:35:36,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2018-12-02 05:35:36,085 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 99 [2018-12-02 05:35:36,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:35:36,085 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2018-12-02 05:35:36,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-02 05:35:36,085 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2018-12-02 05:35:36,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 05:35:36,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:35:36,086 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:35:36,086 INFO L423 AbstractCegarLoop]: === Iteration 35 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:35:36,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:35:36,086 INFO L82 PathProgramCache]: Analyzing trace with hash -237756565, now seen corresponding path program 1 times [2018-12-02 05:35:36,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:35:36,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:35:36,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:35:36,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:35:36,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:35:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:35:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 05:35:36,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:35:36,540 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/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 05:35:36,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:35:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:35:36,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:35:36,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:36,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-12-02 05:35:36,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:36,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:36,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 18 [2018-12-02 05:35:36,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 05:35:36,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-02 05:35:36,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:38 [2018-12-02 05:35:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-02 05:35:36,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:35:36,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 7] total 36 [2018-12-02 05:35:36,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-02 05:35:36,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-02 05:35:36,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1231, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 05:35:36,782 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 37 states. [2018-12-02 05:35:37,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:35:37,803 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-12-02 05:35:37,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-02 05:35:37,804 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 100 [2018-12-02 05:35:37,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:35:37,804 INFO L225 Difference]: With dead ends: 100 [2018-12-02 05:35:37,804 INFO L226 Difference]: Without dead ends: 100 [2018-12-02 05:35:37,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 95 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=283, Invalid=2687, Unknown=0, NotChecked=0, Total=2970 [2018-12-02 05:35:37,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-02 05:35:37,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-02 05:35:37,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 05:35:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2018-12-02 05:35:37,806 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 100 [2018-12-02 05:35:37,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:35:37,806 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2018-12-02 05:35:37,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-02 05:35:37,807 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2018-12-02 05:35:37,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 05:35:37,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:35:37,807 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:35:37,807 INFO L423 AbstractCegarLoop]: === Iteration 36 === [dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2018-12-02 05:35:37,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:35:37,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1560894814, now seen corresponding path program 1 times [2018-12-02 05:35:37,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:35:37,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:35:37,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:35:37,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:35:37,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:35:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:35:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 05:35:38,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:35:38,710 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/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 05:35:38,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:35:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:35:38,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:35:38,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:38,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:38,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-02 05:35:38,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:38,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:38,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:34 [2018-12-02 05:35:38,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, 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 05:35:38,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 05:35:38,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:39,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:39,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:39,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-12-02 05:35:39,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-02 05:35:39,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 05:35:39,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:39,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:39,069 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 05:35:39,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:47 [2018-12-02 05:35:39,179 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 28 treesize of output 27 [2018-12-02 05:35:39,181 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 17 [2018-12-02 05:35:39,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:39,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:39,195 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 05:35:39,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2018-12-02 05:35:39,247 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 57 treesize of output 47 [2018-12-02 05:35:39,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:39,249 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 44 treesize of output 59 [2018-12-02 05:35:39,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:39,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:39,265 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 05:35:39,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:69 [2018-12-02 05:35:39,510 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 05:35:39,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:39,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-12-02 05:35:39,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, 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 05:35:39,524 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:39,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:39,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-02 05:35:39,530 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 05:35:39,534 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:35:39,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 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 05:35:39,540 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:72, output treesize:18 [2018-12-02 05:35:45,733 WARN L180 SmtUtils]: Spent 567.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-02 05:35:45,740 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 84 treesize of output 76 [2018-12-02 05:35:45,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2018-12-02 05:35:45,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 05:35:45,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 05:35:45,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-02 05:35:45,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:114, output treesize:156 [2018-12-02 05:35:45,879 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 05:35:45,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:45,887 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 23 [2018-12-02 05:35:45,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:45,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-02 05:35:45,890 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 05:35:45,893 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 05:35:45,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 05:35:45,898 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:59, output treesize:18 [2018-12-02 05:35:52,846 WARN L180 SmtUtils]: Spent 484.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-02 05:35:52,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 46 [2018-12-02 05:35:52,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:52,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:52,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:35:52,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, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 60 [2018-12-02 05:35:52,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:52,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:35:52,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 05:35:52,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:92, output treesize:70 [2018-12-02 05:35:52,935 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 05:35:52,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:52,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 05:35:52,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:42 [2018-12-02 05:35:53,109 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 05:35:53,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:53,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 05:35:53,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:42 [2018-12-02 05:35:53,184 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 05:35:53,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:53,197 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 05:35:53,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:35:53,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 05:35:53,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:31 [2018-12-02 05:35:55,519 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2018-12-02 05:36:07,493 WARN L180 SmtUtils]: Spent 2.36 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-02 05:36:09,499 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((main_~s~0.offset Int) (v_main_~s~0.base_BEFORE_CALL_30 Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_30))) (let ((.cse0 (select .cse1 main_~s~0.offset))) (and (<= 0 main_~s~0.offset) (= .cse0 (select .cse1 (+ main_~s~0.offset 4))) (<= main_~s~0.offset 0) (not (= .cse0 v_main_~s~0.base_BEFORE_CALL_30)))))) (exists ((dll_circular_destroy_~head.offset Int)) (and (= (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_dll_circular_destroy_#in~head.base|) dll_circular_destroy_~head.offset) 0) |c_dll_circular_destroy_#in~head.base| 0) |c_#valid|) (<= dll_circular_destroy_~head.offset 0) (<= 0 dll_circular_destroy_~head.offset)))) is different from true [2018-12-02 05:36:09,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:36:09,505 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:36:09,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:36:09,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 46 [2018-12-02 05:36:09,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-12-02 05:36:09,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:36:09,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:36:09,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 53 [2018-12-02 05:36:09,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:36:09,536 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:36:09,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-12-02 05:36:09,537 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 05:36:09,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:36:09,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-12-02 05:36:09,556 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:36:09,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:36:09,568 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:36:09,569 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:36:09,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-12-02 05:36:09,570 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 05:36:09,581 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 05:36:09,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-02 05:36:09,597 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:102, output treesize:51 [2018-12-02 05:36:09,718 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 12 refuted. 2 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 05:36:09,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:36:09,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 36] total 65 [2018-12-02 05:36:09,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-02 05:36:09,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-02 05:36:09,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=3914, Unknown=29, NotChecked=126, Total=4290 [2018-12-02 05:36:09,735 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand 66 states. [2018-12-02 05:36:34,836 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2018-12-02 05:36:40,825 WARN L180 SmtUtils]: Spent 4.95 s on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2018-12-02 05:36:46,903 WARN L180 SmtUtils]: Spent 5.02 s on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2018-12-02 05:36:51,551 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2018-12-02 05:36:51,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:36:51,552 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2018-12-02 05:36:51,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-02 05:36:51,552 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 104 [2018-12-02 05:36:51,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:36:51,552 INFO L225 Difference]: With dead ends: 99 [2018-12-02 05:36:51,552 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 05:36:51,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 78 SyntacticMatches, 8 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1927 ImplicationChecksByTransitivity, 54.1s TimeCoverageRelationStatistics Valid=494, Invalid=7484, Unknown=36, NotChecked=176, Total=8190 [2018-12-02 05:36:51,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 05:36:51,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 05:36:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 05:36:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 05:36:51,553 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2018-12-02 05:36:51,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:36:51,553 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 05:36:51,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-02 05:36:51,553 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 05:36:51,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 05:36:51,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:36:51 BoogieIcfgContainer [2018-12-02 05:36:51,556 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 05:36:51,557 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 05:36:51,557 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 05:36:51,557 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 05:36:51,557 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:32:46" (3/4) ... [2018-12-02 05:36:51,559 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 05:36:51,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 05:36:51,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-12-02 05:36:51,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_destroy [2018-12-02 05:36:51,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-02 05:36:51,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-02 05:36:51,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 05:36:51,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_create [2018-12-02 05:36:51,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_update_at [2018-12-02 05:36:51,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-12-02 05:36:51,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_get_data_at [2018-12-02 05:36:51,567 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2018-12-02 05:36:51,568 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-02 05:36:51,568 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 05:36:51,595 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a8448cb2-8a1c-473e-ae11-85ad6a298ae7/bin-2019/uautomizer/witness.graphml [2018-12-02 05:36:51,595 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 05:36:51,596 INFO L168 Benchmark]: Toolchain (without parser) took 245794.37 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 235.4 MB). Free memory was 950.6 MB in the beginning and 787.6 MB in the end (delta: 163.0 MB). Peak memory consumption was 398.4 MB. Max. memory is 11.5 GB. [2018-12-02 05:36:51,596 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:36:51,596 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-12-02 05:36:51,596 INFO L168 Benchmark]: Boogie Preprocessor took 32.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-12-02 05:36:51,596 INFO L168 Benchmark]: RCFGBuilder took 299.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2018-12-02 05:36:51,596 INFO L168 Benchmark]: TraceAbstraction took 245133.05 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 104.9 MB). Free memory was 1.0 GB in the beginning and 791.6 MB in the end (delta: 256.3 MB). Peak memory consumption was 361.2 MB. Max. memory is 11.5 GB. [2018-12-02 05:36:51,597 INFO L168 Benchmark]: Witness Printer took 38.35 ms. Allocated memory is still 1.3 GB. Free memory was 791.6 MB in the beginning and 787.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. [2018-12-02 05:36:51,597 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 288.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 299.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 245133.05 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 104.9 MB). Free memory was 1.0 GB in the beginning and 791.6 MB in the end (delta: 256.3 MB). Peak memory consumption was 361.2 MB. Max. memory is 11.5 GB. * Witness Printer took 38.35 ms. Allocated memory is still 1.3 GB. Free memory was 791.6 MB in the beginning and 787.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 615]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 610]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 610]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 606]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 603]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 603]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 606]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 117 locations, 31 error locations. SAFE Result, 245.0s OverallTime, 36 OverallIterations, 3 TraceHistogramMax, 153.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2710 SDtfs, 2753 SDslu, 15576 SDs, 0 SdLazy, 25955 SolverSat, 775 SolverUnsat, 57 SolverUnknown, 0 SolverNotchecked, 69.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1836 GetRequests, 845 SyntacticMatches, 95 SemanticMatches, 896 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 10555 ImplicationChecksByTransitivity, 165.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=25, 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, 36 MinimizatonAttempts, 193 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 89.9s InterpolantComputationTime, 3103 NumberOfCodeBlocks, 3103 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 3051 ConstructedInterpolants, 239 QuantifiedInterpolants, 3514077 SizeOfPredicates, 239 NumberOfNonLiveVariables, 5211 ConjunctsInSsa, 910 ConjunctsInUnsatCore, 52 InterpolantComputations, 20 PerfectInterpolantSequences, 658/986 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...