./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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/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_dc528136-fba9-4406-a2f3-88975a4a5891/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/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-0cd3be1 [2018-11-28 11:14:16,929 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:14:16,930 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:14:16,939 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:14:16,940 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:14:16,940 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:14:16,941 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:14:16,943 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:14:16,944 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:14:16,945 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:14:16,945 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:14:16,946 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:14:16,946 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:14:16,947 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:14:16,948 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:14:16,948 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:14:16,949 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:14:16,951 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:14:16,952 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:14:16,953 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:14:16,954 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:14:16,956 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:14:16,958 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:14:16,958 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:14:16,958 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:14:16,959 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:14:16,960 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:14:16,961 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:14:16,961 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:14:16,962 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:14:16,963 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:14:16,964 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:14:16,964 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:14:16,964 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:14:16,965 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:14:16,966 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:14:16,966 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 11:14:16,977 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:14:16,977 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:14:16,978 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:14:16,978 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:14:16,979 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:14:16,979 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:14:16,979 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:14:16,979 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:14:16,979 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:14:16,979 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:14:16,980 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:14:16,980 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:14:16,980 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:14:16,980 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 11:14:16,980 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 11:14:16,980 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 11:14:16,980 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:14:16,981 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:14:16,981 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:14:16,981 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:14:16,981 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:14:16,981 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:14:16,981 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:14:16,981 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:14:16,982 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:14:16,982 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:14:16,982 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:14:16,982 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:14:16,982 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_dc528136-fba9-4406-a2f3-88975a4a5891/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-11-28 11:14:17,012 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:14:17,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:14:17,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:14:17,025 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:14:17,026 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:14:17,026 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-28 11:14:17,071 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/bin-2019/uautomizer/data/2b4f1cc7f/a301012a1181432fbb6591c5f12643d1/FLAGcddbf690d [2018-11-28 11:14:17,471 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:14:17,472 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/sv-benchmarks/c/list-simple/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-28 11:14:17,482 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/bin-2019/uautomizer/data/2b4f1cc7f/a301012a1181432fbb6591c5f12643d1/FLAGcddbf690d [2018-11-28 11:14:17,842 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/bin-2019/uautomizer/data/2b4f1cc7f/a301012a1181432fbb6591c5f12643d1 [2018-11-28 11:14:17,845 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:14:17,846 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 11:14:17,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:14:17,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:14:17,850 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:14:17,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:14:17" (1/1) ... [2018-11-28 11:14:17,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@443027f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:17, skipping insertion in model container [2018-11-28 11:14:17,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:14:17" (1/1) ... [2018-11-28 11:14:17,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:14:17,889 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:14:18,095 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:14:18,104 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:14:18,178 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:14:18,213 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:14:18,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:18 WrapperNode [2018-11-28 11:14:18,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:14:18,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:14:18,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:14:18,214 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:14:18,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:18" (1/1) ... [2018-11-28 11:14:18,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:18" (1/1) ... [2018-11-28 11:14:18,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:18" (1/1) ... [2018-11-28 11:14:18,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:18" (1/1) ... [2018-11-28 11:14:18,249 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:18" (1/1) ... [2018-11-28 11:14:18,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:18" (1/1) ... [2018-11-28 11:14:18,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:18" (1/1) ... [2018-11-28 11:14:18,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:14:18,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:14:18,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:14:18,261 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:14:18,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:14:18,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:14:18,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:14:18,296 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 11:14:18,297 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 11:14:18,297 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-11-28 11:14:18,297 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-28 11:14:18,297 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-11-28 11:14:18,297 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2018-11-28 11:14:18,297 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2018-11-28 11:14:18,297 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2018-11-28 11:14:18,297 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:14:18,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 11:14:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 11:14:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 11:14:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 11:14:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 11:14:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 11:14:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 11:14:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 11:14:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 11:14:18,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 11:14:18,299 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 11:14:18,299 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 11:14:18,299 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 11:14:18,299 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 11:14:18,299 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 11:14:18,299 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 11:14:18,299 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 11:14:18,299 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 11:14:18,299 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 11:14:18,300 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 11:14:18,300 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 11:14:18,300 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 11:14:18,300 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 11:14:18,300 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 11:14:18,300 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 11:14:18,300 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 11:14:18,300 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 11:14:18,300 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 11:14:18,300 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 11:14:18,300 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 11:14:18,300 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 11:14:18,300 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 11:14:18,301 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 11:14:18,301 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 11:14:18,301 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 11:14:18,301 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 11:14:18,301 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 11:14:18,301 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 11:14:18,301 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 11:14:18,301 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 11:14:18,301 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 11:14:18,301 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 11:14:18,301 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 11:14:18,301 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 11:14:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 11:14:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 11:14:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 11:14:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 11:14:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 11:14:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 11:14:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 11:14:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 11:14:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 11:14:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 11:14:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 11:14:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 11:14:18,302 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 11:14:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 11:14:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 11:14:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 11:14:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 11:14:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-28 11:14:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 11:14:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 11:14:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-28 11:14:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 11:14:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 11:14:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-28 11:14:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 11:14:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 11:14:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 11:14:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 11:14:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 11:14:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 11:14:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 11:14:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 11:14:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 11:14:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 11:14:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 11:14:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 11:14:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 11:14:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 11:14:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 11:14:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 11:14:18,304 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 11:14:18,305 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 11:14:18,305 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 11:14:18,305 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 11:14:18,305 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 11:14:18,305 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 11:14:18,305 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 11:14:18,305 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 11:14:18,305 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 11:14:18,305 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 11:14:18,305 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 11:14:18,305 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 11:14:18,305 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 11:14:18,305 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 11:14:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 11:14:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 11:14:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 11:14:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 11:14:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 11:14:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 11:14:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 11:14:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 11:14:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-11-28 11:14:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-28 11:14:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:14:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 11:14:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:14:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-11-28 11:14:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2018-11-28 11:14:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 11:14:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:14:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2018-11-28 11:14:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:14:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2018-11-28 11:14:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:14:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:14:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:14:18,730 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:14:18,730 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-28 11:14:18,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:14:18 BoogieIcfgContainer [2018-11-28 11:14:18,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:14:18,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:14:18,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:14:18,734 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:14:18,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:14:17" (1/3) ... [2018-11-28 11:14:18,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cdbd13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:14:18, skipping insertion in model container [2018-11-28 11:14:18,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:18" (2/3) ... [2018-11-28 11:14:18,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cdbd13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:14:18, skipping insertion in model container [2018-11-28 11:14:18,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:14:18" (3/3) ... [2018-11-28 11:14:18,737 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-28 11:14:18,744 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:14:18,752 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2018-11-28 11:14:18,762 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2018-11-28 11:14:18,777 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:14:18,778 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:14:18,778 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 11:14:18,778 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:14:18,778 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:14:18,778 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:14:18,779 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:14:18,779 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:14:18,779 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:14:18,791 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2018-11-28 11:14:18,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 11:14:18,798 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:14:18,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:14:18,800 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:14:18,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:18,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1843482384, now seen corresponding path program 1 times [2018-11-28 11:14:18,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:18,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:18,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:18,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:18,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:18,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:14:18,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:14:18,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:14:18,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:14:18,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:14:18,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:14:18,936 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 3 states. [2018-11-28 11:14:19,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:14:19,050 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-11-28 11:14:19,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:14:19,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-28 11:14:19,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:14:19,060 INFO L225 Difference]: With dead ends: 106 [2018-11-28 11:14:19,060 INFO L226 Difference]: Without dead ends: 99 [2018-11-28 11:14:19,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:14:19,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-28 11:14:19,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-11-28 11:14:19,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-28 11:14:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-11-28 11:14:19,092 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 12 [2018-11-28 11:14:19,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:14:19,092 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-11-28 11:14:19,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:14:19,092 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-11-28 11:14:19,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 11:14:19,092 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:14:19,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:14:19,093 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:14:19,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:19,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1843482383, now seen corresponding path program 1 times [2018-11-28 11:14:19,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:19,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:19,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:19,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:19,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:14:19,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:14:19,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:14:19,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:14:19,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:14:19,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:14:19,158 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 3 states. [2018-11-28 11:14:19,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:14:19,234 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2018-11-28 11:14:19,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:14:19,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-28 11:14:19,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:14:19,235 INFO L225 Difference]: With dead ends: 96 [2018-11-28 11:14:19,236 INFO L226 Difference]: Without dead ends: 96 [2018-11-28 11:14:19,236 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-11-28 11:14:19,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-28 11:14:19,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-11-28 11:14:19,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 11:14:19,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-11-28 11:14:19,244 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 12 [2018-11-28 11:14:19,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:14:19,244 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-11-28 11:14:19,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:14:19,245 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-11-28 11:14:19,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 11:14:19,246 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:14:19,246 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-11-28 11:14:19,247 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:14:19,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:19,247 INFO L82 PathProgramCache]: Analyzing trace with hash 92083562, now seen corresponding path program 1 times [2018-11-28 11:14:19,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:19,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:19,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:19,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:19,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:14:19,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:14:19,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:14:19,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:14:19,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:14:19,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:14:19,321 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 5 states. [2018-11-28 11:14:19,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:14:19,378 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-11-28 11:14:19,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:14:19,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-28 11:14:19,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:14:19,380 INFO L225 Difference]: With dead ends: 97 [2018-11-28 11:14:19,380 INFO L226 Difference]: Without dead ends: 97 [2018-11-28 11:14:19,380 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-11-28 11:14:19,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-28 11:14:19,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-11-28 11:14:19,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-28 11:14:19,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-11-28 11:14:19,387 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 20 [2018-11-28 11:14:19,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:14:19,388 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-11-28 11:14:19,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:14:19,389 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-11-28 11:14:19,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 11:14:19,389 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:14:19,389 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-11-28 11:14:19,390 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:14:19,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:19,390 INFO L82 PathProgramCache]: Analyzing trace with hash -612607148, now seen corresponding path program 1 times [2018-11-28 11:14:19,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:19,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:19,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:19,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:19,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:19,482 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:14:19,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:14:19,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:14:19,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:14:19,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:14:19,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:14:19,483 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 6 states. [2018-11-28 11:14:19,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:14:19,590 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2018-11-28 11:14:19,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:14:19,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-28 11:14:19,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:14:19,592 INFO L225 Difference]: With dead ends: 97 [2018-11-28 11:14:19,592 INFO L226 Difference]: Without dead ends: 97 [2018-11-28 11:14:19,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:14:19,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-28 11:14:19,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-11-28 11:14:19,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 11:14:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-11-28 11:14:19,599 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 30 [2018-11-28 11:14:19,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:14:19,600 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-11-28 11:14:19,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:14:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-11-28 11:14:19,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 11:14:19,601 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:14:19,601 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-11-28 11:14:19,601 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:14:19,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:19,601 INFO L82 PathProgramCache]: Analyzing trace with hash -612607149, now seen corresponding path program 1 times [2018-11-28 11:14:19,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:19,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:19,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:19,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:19,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 11:14:19,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:14:19,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:14:19,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:14:19,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:14:19,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:14:19,660 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 6 states. [2018-11-28 11:14:19,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:14:19,749 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2018-11-28 11:14:19,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:14:19,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-28 11:14:19,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:14:19,750 INFO L225 Difference]: With dead ends: 96 [2018-11-28 11:14:19,750 INFO L226 Difference]: Without dead ends: 96 [2018-11-28 11:14:19,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:14:19,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-28 11:14:19,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-28 11:14:19,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-28 11:14:19,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-11-28 11:14:19,755 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 30 [2018-11-28 11:14:19,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:14:19,755 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-11-28 11:14:19,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:14:19,755 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-11-28 11:14:19,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 11:14:19,756 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:14:19,756 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-11-28 11:14:19,756 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:14:19,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:19,756 INFO L82 PathProgramCache]: Analyzing trace with hash -304950988, now seen corresponding path program 1 times [2018-11-28 11:14:19,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:19,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:19,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:19,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:19,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:19,912 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:14:19,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:14:19,912 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:14:19,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:19,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:14:21,534 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-11-28 11:14:21,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:21,538 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-11-28 11:14:21,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-11-28 11:14:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:14:21,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:14:21,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-11-28 11:14:21,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:14:21,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:14:21,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=96, Unknown=4, NotChecked=0, Total=132 [2018-11-28 11:14:21,577 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 12 states. [2018-11-28 11:14:22,071 WARN L180 SmtUtils]: Spent 433.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-28 11:14:22,391 WARN L180 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-28 11:14:22,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:14:22,784 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2018-11-28 11:14:22,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:14:22,785 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-11-28 11:14:22,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:14:22,785 INFO L225 Difference]: With dead ends: 132 [2018-11-28 11:14:22,786 INFO L226 Difference]: Without dead ends: 132 [2018-11-28 11:14:22,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=58, Invalid=178, Unknown=4, NotChecked=0, Total=240 [2018-11-28 11:14:22,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-28 11:14:22,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 100. [2018-11-28 11:14:22,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-28 11:14:22,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2018-11-28 11:14:22,790 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 32 [2018-11-28 11:14:22,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:14:22,791 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2018-11-28 11:14:22,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:14:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-11-28 11:14:22,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 11:14:22,792 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:14:22,792 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-11-28 11:14:22,792 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:14:22,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:22,792 INFO L82 PathProgramCache]: Analyzing trace with hash -304950987, now seen corresponding path program 1 times [2018-11-28 11:14:22,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:22,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:22,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:22,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:22,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:22,954 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:14:22,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:14:22,955 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:14:22,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:23,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:14:23,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 11:14:23,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:23,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:23,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 11:14:23,316 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-11-28 11:14:23,323 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-11-28 11:14:23,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:23,327 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-11-28 11:14:23,328 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-11-28 11:14:23,334 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-11-28 11:14:23,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:14:23,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2018-11-28 11:14:23,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 11:14:23,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 11:14:23,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=56, Unknown=1, NotChecked=14, Total=90 [2018-11-28 11:14:23,351 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 10 states. [2018-11-28 11:14:23,897 WARN L180 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2018-11-28 11:14:24,454 WARN L180 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2018-11-28 11:14:24,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:14:24,726 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-11-28 11:14:24,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:14:24,726 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-28 11:14:24,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:14:24,727 INFO L225 Difference]: With dead ends: 101 [2018-11-28 11:14:24,727 INFO L226 Difference]: Without dead ends: 101 [2018-11-28 11:14:24,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=39, Invalid=120, Unknown=1, NotChecked=22, Total=182 [2018-11-28 11:14:24,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-28 11:14:24,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-11-28 11:14:24,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-28 11:14:24,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-11-28 11:14:24,731 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 32 [2018-11-28 11:14:24,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:14:24,731 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-11-28 11:14:24,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 11:14:24,732 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-11-28 11:14:24,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 11:14:24,732 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:14:24,732 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-11-28 11:14:24,733 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:14:24,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:24,733 INFO L82 PathProgramCache]: Analyzing trace with hash -999969269, now seen corresponding path program 1 times [2018-11-28 11:14:24,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:24,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:24,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:24,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:24,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:14:24,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:14:24,796 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:14:24,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:24,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:14:24,920 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:14:24,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:14:24,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 8 [2018-11-28 11:14:24,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:14:24,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:14:24,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:14:24,950 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 8 states. [2018-11-28 11:14:25,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:14:25,010 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-11-28 11:14:25,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:14:25,010 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-11-28 11:14:25,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:14:25,011 INFO L225 Difference]: With dead ends: 101 [2018-11-28 11:14:25,011 INFO L226 Difference]: Without dead ends: 101 [2018-11-28 11:14:25,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-28 11:14:25,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-28 11:14:25,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-11-28 11:14:25,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-28 11:14:25,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2018-11-28 11:14:25,016 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 34 [2018-11-28 11:14:25,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:14:25,016 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2018-11-28 11:14:25,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:14:25,016 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2018-11-28 11:14:25,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 11:14:25,017 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:14:25,017 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-11-28 11:14:25,017 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:14:25,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:25,018 INFO L82 PathProgramCache]: Analyzing trace with hash -939056962, now seen corresponding path program 1 times [2018-11-28 11:14:25,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:25,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:25,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:25,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:25,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:25,103 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:14:25,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:14:25,103 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:14:25,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:25,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:14:25,178 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:14:25,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:14:25,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-28 11:14:25,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 11:14:25,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 11:14:25,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:14:25,199 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand 9 states. [2018-11-28 11:14:25,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:14:25,319 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2018-11-28 11:14:25,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:14:25,320 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-28 11:14:25,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:14:25,321 INFO L225 Difference]: With dead ends: 111 [2018-11-28 11:14:25,321 INFO L226 Difference]: Without dead ends: 111 [2018-11-28 11:14:25,321 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-11-28 11:14:25,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-28 11:14:25,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 103. [2018-11-28 11:14:25,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-28 11:14:25,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-11-28 11:14:25,325 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 35 [2018-11-28 11:14:25,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:14:25,325 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-11-28 11:14:25,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 11:14:25,325 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-11-28 11:14:25,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 11:14:25,326 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:14:25,326 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-11-28 11:14:25,326 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:14:25,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:25,327 INFO L82 PathProgramCache]: Analyzing trace with hash -939056963, now seen corresponding path program 1 times [2018-11-28 11:14:25,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:25,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:25,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:25,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:25,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:25,373 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 11:14:25,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:14:25,373 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:14:25,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:25,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:14:25,420 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 11:14:25,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:14:25,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-11-28 11:14:25,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:14:25,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:14:25,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:14:25,439 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 5 states. [2018-11-28 11:14:25,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:14:25,522 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-11-28 11:14:25,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:14:25,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-28 11:14:25,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:14:25,525 INFO L225 Difference]: With dead ends: 104 [2018-11-28 11:14:25,525 INFO L226 Difference]: Without dead ends: 104 [2018-11-28 11:14:25,525 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-11-28 11:14:25,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-28 11:14:25,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-11-28 11:14:25,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-28 11:14:25,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2018-11-28 11:14:25,529 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 35 [2018-11-28 11:14:25,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:14:25,530 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2018-11-28 11:14:25,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:14:25,530 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2018-11-28 11:14:25,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 11:14:25,531 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:14:25,531 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-11-28 11:14:25,534 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:14:25,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:25,535 INFO L82 PathProgramCache]: Analyzing trace with hash 954005222, now seen corresponding path program 1 times [2018-11-28 11:14:25,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:25,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:25,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:25,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:25,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 11:14:25,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:14:25,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:14:25,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:14:25,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:14:25,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:14:25,600 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand 7 states. [2018-11-28 11:14:25,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:14:25,749 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-11-28 11:14:25,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:14:25,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-11-28 11:14:25,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:14:25,751 INFO L225 Difference]: With dead ends: 103 [2018-11-28 11:14:25,751 INFO L226 Difference]: Without dead ends: 103 [2018-11-28 11:14:25,751 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-11-28 11:14:25,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-28 11:14:25,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-11-28 11:14:25,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-28 11:14:25,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-11-28 11:14:25,754 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 36 [2018-11-28 11:14:25,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:14:25,755 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-11-28 11:14:25,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:14:25,755 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-11-28 11:14:25,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 11:14:25,759 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:14:25,759 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-11-28 11:14:25,759 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:14:25,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:25,759 INFO L82 PathProgramCache]: Analyzing trace with hash 954005223, now seen corresponding path program 1 times [2018-11-28 11:14:25,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:25,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:25,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:25,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:25,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:25,824 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:14:25,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:14:25,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:14:25,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:14:25,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:14:25,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:14:25,825 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 7 states. [2018-11-28 11:14:25,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:14:25,945 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-11-28 11:14:25,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:14:25,945 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-11-28 11:14:25,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:14:25,946 INFO L225 Difference]: With dead ends: 101 [2018-11-28 11:14:25,946 INFO L226 Difference]: Without dead ends: 101 [2018-11-28 11:14:25,947 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-11-28 11:14:25,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-28 11:14:25,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-11-28 11:14:25,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-28 11:14:25,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2018-11-28 11:14:25,949 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 36 [2018-11-28 11:14:25,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:14:25,949 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2018-11-28 11:14:25,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:14:25,950 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2018-11-28 11:14:25,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 11:14:25,950 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:14:25,950 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-11-28 11:14:25,951 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:14:25,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:25,953 INFO L82 PathProgramCache]: Analyzing trace with hash 208022194, now seen corresponding path program 1 times [2018-11-28 11:14:25,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:25,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:25,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:25,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:25,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:26,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 11:14:26,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:14:26,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 11:14:26,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:14:26,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:14:26,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:14:26,061 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand 12 states. [2018-11-28 11:14:26,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:14:26,327 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2018-11-28 11:14:26,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 11:14:26,328 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-11-28 11:14:26,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:14:26,329 INFO L225 Difference]: With dead ends: 107 [2018-11-28 11:14:26,329 INFO L226 Difference]: Without dead ends: 107 [2018-11-28 11:14:26,330 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-11-28 11:14:26,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-28 11:14:26,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-11-28 11:14:26,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-28 11:14:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2018-11-28 11:14:26,333 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 45 [2018-11-28 11:14:26,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:14:26,333 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2018-11-28 11:14:26,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:14:26,334 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2018-11-28 11:14:26,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 11:14:26,334 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:14:26,335 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-11-28 11:14:26,335 INFO L423 AbstractCegarLoop]: === Iteration 14 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:14:26,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:26,338 INFO L82 PathProgramCache]: Analyzing trace with hash 208022195, now seen corresponding path program 1 times [2018-11-28 11:14:26,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:26,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:26,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:26,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:26,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:26,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 11:14:26,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:14:26,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:14:26,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:14:26,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:14:26,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:14:26,389 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand 6 states. [2018-11-28 11:14:26,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:14:26,431 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2018-11-28 11:14:26,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:14:26,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-11-28 11:14:26,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:14:26,433 INFO L225 Difference]: With dead ends: 125 [2018-11-28 11:14:26,433 INFO L226 Difference]: Without dead ends: 125 [2018-11-28 11:14:26,433 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-11-28 11:14:26,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-28 11:14:26,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 116. [2018-11-28 11:14:26,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-28 11:14:26,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2018-11-28 11:14:26,437 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 45 [2018-11-28 11:14:26,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:14:26,437 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2018-11-28 11:14:26,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:14:26,437 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2018-11-28 11:14:26,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 11:14:26,438 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:14:26,438 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-11-28 11:14:26,438 INFO L423 AbstractCegarLoop]: === Iteration 15 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:14:26,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:26,439 INFO L82 PathProgramCache]: Analyzing trace with hash 208022250, now seen corresponding path program 1 times [2018-11-28 11:14:26,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:26,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:26,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:26,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:26,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:26,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:14:26,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:14:26,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 11:14:26,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:14:26,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:14:26,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:14:26,599 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. Second operand 12 states. [2018-11-28 11:14:26,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:14:26,842 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2018-11-28 11:14:26,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 11:14:26,843 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-11-28 11:14:26,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:14:26,844 INFO L225 Difference]: With dead ends: 120 [2018-11-28 11:14:26,844 INFO L226 Difference]: Without dead ends: 120 [2018-11-28 11:14:26,844 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-11-28 11:14:26,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-28 11:14:26,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2018-11-28 11:14:26,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-28 11:14:26,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 132 transitions. [2018-11-28 11:14:26,849 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 132 transitions. Word has length 45 [2018-11-28 11:14:26,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:14:26,849 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 132 transitions. [2018-11-28 11:14:26,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:14:26,849 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 132 transitions. [2018-11-28 11:14:26,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 11:14:26,850 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:14:26,850 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-11-28 11:14:26,850 INFO L423 AbstractCegarLoop]: === Iteration 16 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:14:26,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:26,851 INFO L82 PathProgramCache]: Analyzing trace with hash 362970760, now seen corresponding path program 1 times [2018-11-28 11:14:26,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:26,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:26,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:26,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:26,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-28 11:14:26,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:14:26,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:14:26,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:14:26,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:14:26,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:14:26,885 INFO L87 Difference]: Start difference. First operand 116 states and 132 transitions. Second operand 6 states. [2018-11-28 11:14:26,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:14:26,911 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2018-11-28 11:14:26,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:14:26,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-11-28 11:14:26,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:14:26,912 INFO L225 Difference]: With dead ends: 104 [2018-11-28 11:14:26,912 INFO L226 Difference]: Without dead ends: 104 [2018-11-28 11:14:26,913 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-11-28 11:14:26,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-28 11:14:26,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-28 11:14:26,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-28 11:14:26,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-11-28 11:14:26,916 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 47 [2018-11-28 11:14:26,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:14:26,916 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-11-28 11:14:26,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:14:26,917 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-11-28 11:14:26,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 11:14:26,917 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:14:26,917 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-11-28 11:14:26,917 INFO L423 AbstractCegarLoop]: === Iteration 17 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:14:26,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:26,918 INFO L82 PathProgramCache]: Analyzing trace with hash -446967498, now seen corresponding path program 1 times [2018-11-28 11:14:26,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:26,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:26,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:26,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:26,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:27,243 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:14:27,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:14:27,244 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:14:27,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:27,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:14:27,357 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:14:27,358 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:14:27,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:14:27,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:27,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:27,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-28 11:14:27,405 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-11-28 11:14:27,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:14:27,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:27,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:27,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:27,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-28 11:14:27,439 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-11-28 11:14:27,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11-28 11:14:27,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:27,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:27,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:14:27,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-11-28 11:14:27,504 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-11-28 11:14:27,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 11:14:27,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:27,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:27,523 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-11-28 11:14:27,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-11-28 11:14:29,570 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-11-28 11:14:29,578 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-11-28 11:14:29,581 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:14:29,582 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-11-28 11:14:29,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:29,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:29,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:14:29,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2018-11-28 11:14:29,824 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-11-28 11:14:29,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-28 11:14:29,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:29,833 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:14:29,833 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-11-28 11:14:29,834 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:29,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:29,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:29,845 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:5 [2018-11-28 11:14:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:14:29,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:14:29,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 36 [2018-11-28 11:14:29,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-28 11:14:29,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-28 11:14:29,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1242, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 11:14:29,884 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 37 states. [2018-11-28 11:14:31,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:14:31,112 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2018-11-28 11:14:31,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-28 11:14:31,113 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 48 [2018-11-28 11:14:31,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:14:31,114 INFO L225 Difference]: With dead ends: 129 [2018-11-28 11:14:31,114 INFO L226 Difference]: Without dead ends: 129 [2018-11-28 11:14:31,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=204, Invalid=2346, Unknown=0, NotChecked=0, Total=2550 [2018-11-28 11:14:31,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-28 11:14:31,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2018-11-28 11:14:31,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-28 11:14:31,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2018-11-28 11:14:31,119 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 48 [2018-11-28 11:14:31,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:14:31,120 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2018-11-28 11:14:31,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-28 11:14:31,120 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2018-11-28 11:14:31,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 11:14:31,120 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:14:31,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] [2018-11-28 11:14:31,121 INFO L423 AbstractCegarLoop]: === Iteration 18 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:14:31,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:31,121 INFO L82 PathProgramCache]: Analyzing trace with hash -446967497, now seen corresponding path program 1 times [2018-11-28 11:14:31,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:31,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:31,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:31,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:31,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:14:31,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:14:31,623 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:14:31,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:31,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:14:31,863 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:14:31,864 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-11-28 11:14:31,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:31,877 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:14:31,883 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:14:31,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:14:31,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:31,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:31,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-11-28 11:14:31,982 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-11-28 11:14:31,987 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-11-28 11:14:31,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:31,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:32,004 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-11-28 11:14:32,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:14:32,006 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:32,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:32,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:32,020 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2018-11-28 11:14:32,088 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-11-28 11:14:32,090 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-11-28 11:14:32,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:32,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:32,117 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-11-28 11:14:32,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:14:32,120 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:32,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:32,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:32,138 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:65 [2018-11-28 11:14:32,248 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-11-28 11:14:32,252 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:14:32,253 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-11-28 11:14:32,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:32,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:32,295 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-11-28 11:14:32,299 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:14:32,300 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-11-28 11:14:32,300 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:32,310 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:32,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:32,328 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:111, output treesize:95 [2018-11-28 11:14:32,403 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:14:32,410 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-11-28 11:14:32,415 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:14:32,416 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-11-28 11:14:32,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:32,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:32,470 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-11-28 11:14:32,482 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:14:32,483 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-11-28 11:14:32,484 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:32,492 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:32,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:14:32,510 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:146, output treesize:152 [2018-11-28 11:14:32,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:14:32,900 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-11-28 11:14:32,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:14:32,903 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-11-28 11:14:32,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:32,915 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:14:32,916 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-11-28 11:14:32,916 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:32,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:32,936 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-11-28 11:14:32,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:14:32,939 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-11-28 11:14:32,939 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:32,945 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:14:32,945 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-11-28 11:14:32,946 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:32,948 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:32,953 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-11-28 11:14:32,953 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:166, output treesize:23 [2018-11-28 11:14:33,035 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:14:33,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:14:33,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2018-11-28 11:14:33,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-28 11:14:33,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-28 11:14:33,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1862, Unknown=0, NotChecked=0, Total=1980 [2018-11-28 11:14:33,051 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand 45 states. [2018-11-28 11:14:34,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:14:34,847 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2018-11-28 11:14:34,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-28 11:14:34,847 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 48 [2018-11-28 11:14:34,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:14:34,848 INFO L225 Difference]: With dead ends: 130 [2018-11-28 11:14:34,848 INFO L226 Difference]: Without dead ends: 130 [2018-11-28 11:14:34,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=258, Invalid=3402, Unknown=0, NotChecked=0, Total=3660 [2018-11-28 11:14:34,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-28 11:14:34,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 108. [2018-11-28 11:14:34,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-28 11:14:34,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2018-11-28 11:14:34,854 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 48 [2018-11-28 11:14:34,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:14:34,855 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2018-11-28 11:14:34,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-28 11:14:34,855 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2018-11-28 11:14:34,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 11:14:34,856 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:14:34,856 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-11-28 11:14:34,856 INFO L423 AbstractCegarLoop]: === Iteration 19 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:14:34,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:34,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1208456142, now seen corresponding path program 2 times [2018-11-28 11:14:34,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:34,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:34,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:34,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:34,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:34,899 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 11:14:34,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:14:34,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:14:34,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:14:34,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:14:34,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:14:34,900 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 7 states. [2018-11-28 11:14:34,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:14:34,959 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2018-11-28 11:14:34,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:14:34,960 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-28 11:14:34,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:14:34,961 INFO L225 Difference]: With dead ends: 100 [2018-11-28 11:14:34,961 INFO L226 Difference]: Without dead ends: 100 [2018-11-28 11:14:34,961 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-11-28 11:14:34,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-28 11:14:34,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-11-28 11:14:34,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-28 11:14:34,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-11-28 11:14:34,964 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 51 [2018-11-28 11:14:34,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:14:34,965 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-11-28 11:14:34,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:14:34,965 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-11-28 11:14:34,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 11:14:34,965 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:14:34,965 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-11-28 11:14:34,966 INFO L423 AbstractCegarLoop]: === Iteration 20 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:14:34,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:34,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1664125494, now seen corresponding path program 1 times [2018-11-28 11:14:34,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:34,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:34,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:34,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:14:34,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:35,066 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 11:14:35,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:14:35,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 11:14:35,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:14:35,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:14:35,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:14:35,067 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 12 states. [2018-11-28 11:14:35,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:14:35,251 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2018-11-28 11:14:35,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 11:14:35,251 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-11-28 11:14:35,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:14:35,251 INFO L225 Difference]: With dead ends: 105 [2018-11-28 11:14:35,251 INFO L226 Difference]: Without dead ends: 105 [2018-11-28 11:14:35,252 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-11-28 11:14:35,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-28 11:14:35,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-11-28 11:14:35,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-28 11:14:35,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2018-11-28 11:14:35,253 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 58 [2018-11-28 11:14:35,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:14:35,253 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2018-11-28 11:14:35,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:14:35,254 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2018-11-28 11:14:35,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 11:14:35,254 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:14:35,254 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-11-28 11:14:35,254 INFO L423 AbstractCegarLoop]: === Iteration 21 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:14:35,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:35,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1664125493, now seen corresponding path program 1 times [2018-11-28 11:14:35,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:35,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:35,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:35,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:35,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:35,288 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 11:14:35,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:14:35,289 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:14:35,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:35,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:14:35,366 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 11:14:35,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:14:35,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-28 11:14:35,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:14:35,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:14:35,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:14:35,385 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand 5 states. [2018-11-28 11:14:35,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:14:35,411 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2018-11-28 11:14:35,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:14:35,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-11-28 11:14:35,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:14:35,412 INFO L225 Difference]: With dead ends: 110 [2018-11-28 11:14:35,412 INFO L226 Difference]: Without dead ends: 110 [2018-11-28 11:14:35,412 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-11-28 11:14:35,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-28 11:14:35,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-11-28 11:14:35,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-28 11:14:35,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2018-11-28 11:14:35,415 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 58 [2018-11-28 11:14:35,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:14:35,415 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2018-11-28 11:14:35,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:14:35,415 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2018-11-28 11:14:35,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 11:14:35,416 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:14:35,416 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-11-28 11:14:35,416 INFO L423 AbstractCegarLoop]: === Iteration 22 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:14:35,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:35,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1612389058, now seen corresponding path program 1 times [2018-11-28 11:14:35,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:35,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:35,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:35,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:35,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:35,465 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 11:14:35,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:14:35,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:14:35,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:14:35,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:14:35,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:14:35,466 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 7 states. [2018-11-28 11:14:35,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:14:35,525 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-11-28 11:14:35,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:14:35,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2018-11-28 11:14:35,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:14:35,527 INFO L225 Difference]: With dead ends: 104 [2018-11-28 11:14:35,527 INFO L226 Difference]: Without dead ends: 104 [2018-11-28 11:14:35,527 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-11-28 11:14:35,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-28 11:14:35,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-28 11:14:35,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-28 11:14:35,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2018-11-28 11:14:35,530 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 59 [2018-11-28 11:14:35,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:14:35,531 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2018-11-28 11:14:35,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:14:35,531 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2018-11-28 11:14:35,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 11:14:35,531 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:14:35,531 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-11-28 11:14:35,532 INFO L423 AbstractCegarLoop]: === Iteration 23 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:14:35,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:35,532 INFO L82 PathProgramCache]: Analyzing trace with hash -2144929985, now seen corresponding path program 2 times [2018-11-28 11:14:35,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:35,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:35,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:35,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:35,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:35,599 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-28 11:14:35,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:14:35,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:14:35,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:14:35,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:14:35,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:14:35,600 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 6 states. [2018-11-28 11:14:35,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:14:35,644 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2018-11-28 11:14:35,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:14:35,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-28 11:14:35,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:14:35,646 INFO L225 Difference]: With dead ends: 118 [2018-11-28 11:14:35,646 INFO L226 Difference]: Without dead ends: 118 [2018-11-28 11:14:35,646 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-11-28 11:14:35,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-28 11:14:35,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2018-11-28 11:14:35,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-28 11:14:35,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2018-11-28 11:14:35,649 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 66 [2018-11-28 11:14:35,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:14:35,649 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2018-11-28 11:14:35,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:14:35,650 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2018-11-28 11:14:35,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 11:14:35,650 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:14:35,650 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-11-28 11:14:35,650 INFO L423 AbstractCegarLoop]: === Iteration 24 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:14:35,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:35,651 INFO L82 PathProgramCache]: Analyzing trace with hash -2144929930, now seen corresponding path program 1 times [2018-11-28 11:14:35,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:35,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:35,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:35,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:14:35,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:35,757 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-28 11:14:35,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:14:35,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 11:14:35,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:14:35,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:14:35,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:14:35,758 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand 12 states. [2018-11-28 11:14:35,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:14:35,939 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2018-11-28 11:14:35,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 11:14:35,939 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-11-28 11:14:35,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:14:35,940 INFO L225 Difference]: With dead ends: 119 [2018-11-28 11:14:35,940 INFO L226 Difference]: Without dead ends: 119 [2018-11-28 11:14:35,940 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-11-28 11:14:35,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-28 11:14:35,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2018-11-28 11:14:35,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-28 11:14:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2018-11-28 11:14:35,943 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 66 [2018-11-28 11:14:35,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:14:35,943 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2018-11-28 11:14:35,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:14:35,943 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2018-11-28 11:14:35,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 11:14:35,944 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:14:35,944 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-11-28 11:14:35,944 INFO L423 AbstractCegarLoop]: === Iteration 25 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:14:35,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:35,944 INFO L82 PathProgramCache]: Analyzing trace with hash 915903942, now seen corresponding path program 1 times [2018-11-28 11:14:35,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:35,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:35,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:35,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:35,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:36,447 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:14:36,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:14:36,447 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:14:36,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:36,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:14:36,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:14:36,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:14:36,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:14:36,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:36,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:36,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-28 11:14:36,582 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-11-28 11:14:36,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:14:36,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:36,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:36,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:36,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-28 11:14:36,612 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-11-28 11:14:36,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11-28 11:14:36,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:36,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:36,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:14:36,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-11-28 11:14:36,675 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-11-28 11:14:36,678 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-11-28 11:14:36,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:36,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:36,686 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-11-28 11:14:36,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-11-28 11:14:36,715 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-11-28 11:14:36,717 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:14:36,717 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-11-28 11:14:36,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:36,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:36,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:14:36,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-11-28 11:14:37,683 WARN L180 SmtUtils]: Spent 723.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 11:14:37,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 75 treesize of output 67 [2018-11-28 11:14:37,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 11:14:37,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:14:37,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:14:37,726 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-11-28 11:14:37,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:78 [2018-11-28 11:14:37,794 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-11-28 11:14:37,796 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:14:37,797 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-11-28 11:14:37,798 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:14:37,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:14:37,805 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-11-28 11:14:37,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2018-11-28 11:14:47,152 WARN L180 SmtUtils]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-28 11:14:47,156 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-11-28 11:14:47,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:14:47,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:14:47,160 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:14:47,162 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-11-28 11:14:47,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:47,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:47,173 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-11-28 11:14:47,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:36 [2018-11-28 11:14:47,282 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-11-28 11:14:47,283 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:14:47,284 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-11-28 11:14:47,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:14:47,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:47,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:14:47,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2018-11-28 11:14:47,315 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 11:14:47,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:14:47,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 50 [2018-11-28 11:14:47,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-28 11:14:47,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-28 11:14:47,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2390, Unknown=17, NotChecked=0, Total=2550 [2018-11-28 11:14:47,332 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand 51 states. [2018-11-28 11:15:01,106 WARN L180 SmtUtils]: Spent 839.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-28 11:15:04,214 WARN L180 SmtUtils]: Spent 542.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-28 11:15:08,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:15:08,133 INFO L93 Difference]: Finished difference Result 146 states and 161 transitions. [2018-11-28 11:15:08,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-28 11:15:08,133 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 69 [2018-11-28 11:15:08,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:15:08,134 INFO L225 Difference]: With dead ends: 146 [2018-11-28 11:15:08,134 INFO L226 Difference]: Without dead ends: 146 [2018-11-28 11:15:08,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 42 SyntacticMatches, 10 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=416, Invalid=5267, Unknown=17, NotChecked=0, Total=5700 [2018-11-28 11:15:08,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-28 11:15:08,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2018-11-28 11:15:08,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-28 11:15:08,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 139 transitions. [2018-11-28 11:15:08,139 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 139 transitions. Word has length 69 [2018-11-28 11:15:08,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:15:08,140 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 139 transitions. [2018-11-28 11:15:08,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-28 11:15:08,140 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 139 transitions. [2018-11-28 11:15:08,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 11:15:08,141 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:15:08,141 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-11-28 11:15:08,142 INFO L423 AbstractCegarLoop]: === Iteration 26 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:15:08,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:15:08,142 INFO L82 PathProgramCache]: Analyzing trace with hash 915903943, now seen corresponding path program 1 times [2018-11-28 11:15:08,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:15:08,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:15:08,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:15:08,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:15:08,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:15:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:15:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:15:09,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:15:09,184 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:15:09,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:15:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:15:09,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:15:09,292 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:09,293 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:09,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:15:09,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:09,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:09,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-28 11:15:09,347 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-11-28 11:15:09,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 8 treesize of output 7 [2018-11-28 11:15:09,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:09,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:09,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:09,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-28 11:15:09,386 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-11-28 11:15:09,388 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-11-28 11:15:09,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:09,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:09,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:15:09,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-11-28 11:15:09,474 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-11-28 11:15:09,477 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-11-28 11:15:09,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:09,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:09,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:15:09,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-11-28 11:15:11,523 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-28 11:15:11,530 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-11-28 11:15:11,533 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:11,534 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-11-28 11:15:11,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:11,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:11,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 11:15:11,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 11:15:11,558 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:11,560 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:11,567 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-11-28 11:15:11,568 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:52 [2018-11-28 11:15:13,625 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2018-11-28 11:15:15,677 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2018-11-28 11:15:17,739 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 23 [2018-11-28 11:15:19,793 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2018-11-28 11:15:19,978 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-11-28 11:15:19,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-28 11:15:19,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:19,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:20,002 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-11-28 11:15:20,016 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-11-28 11:15:20,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-11-28 11:15:20,038 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-28 11:15:20,068 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-11-28 11:15:20,068 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:154, output treesize:283 [2018-11-28 11:15:20,173 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-11-28 11:15:20,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:20,180 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:20,180 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-11-28 11:15:20,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:20,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:20,202 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-11-28 11:15:20,204 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:20,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2018-11-28 11:15:20,206 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:15:20,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:15:20,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:20,229 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-11-28 11:15:20,231 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:20,232 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-11-28 11:15:20,232 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:15:20,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:15:20,241 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:20,246 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:15:20,258 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-11-28 11:15:20,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:20,260 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-11-28 11:15:20,261 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:15:20,265 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:15:20,274 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-11-28 11:15:20,274 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:139, output treesize:25 [2018-11-28 11:15:21,068 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-11-28 11:15:21,080 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-11-28 11:15:21,084 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:21,085 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:21,086 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:21,088 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-11-28 11:15:21,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:21,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:21,146 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-11-28 11:15:21,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:21,149 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:21,150 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:21,154 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-11-28 11:15:21,154 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:21,171 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:21,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 77 [2018-11-28 11:15:21,207 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:21,208 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:21,208 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:21,209 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:21,212 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-11-28 11:15:21,212 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:21,223 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:21,249 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:21,252 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-11-28 11:15:21,255 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:21,259 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:21,263 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:21,266 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-11-28 11:15:21,266 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:21,278 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:21,306 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-11-28 11:15:21,306 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:219, output treesize:135 [2018-11-28 11:15:21,500 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-11-28 11:15:21,502 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:21,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11-28 11:15:21,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:21,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:21,533 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-11-28 11:15:21,535 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:21,536 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:21,536 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-11-28 11:15:21,537 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:21,542 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:21,562 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-11-28 11:15:21,564 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:21,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11-28 11:15:21,566 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:15:21,575 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:15:21,589 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:21,590 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-11-28 11:15:21,596 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:21,597 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-11-28 11:15:21,597 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:21,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:15:21,603 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:21,607 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:21,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:21,623 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:155, output treesize:13 [2018-11-28 11:15:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-11-28 11:15:21,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:15:21,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 53 [2018-11-28 11:15:21,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-28 11:15:21,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-28 11:15:21,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2615, Unknown=1, NotChecked=102, Total=2862 [2018-11-28 11:15:21,657 INFO L87 Difference]: Start difference. First operand 122 states and 139 transitions. Second operand 54 states. [2018-11-28 11:15:26,298 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-11-28 11:15:30,394 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2018-11-28 11:15:38,507 WARN L180 SmtUtils]: Spent 8.06 s on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2018-11-28 11:15:42,572 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-11-28 11:15:46,631 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-11-28 11:15:53,595 WARN L180 SmtUtils]: Spent 6.45 s on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2018-11-28 11:15:54,119 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2018-11-28 11:15:54,658 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2018-11-28 11:15:55,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:15:55,155 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2018-11-28 11:15:55,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-28 11:15:55,156 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 69 [2018-11-28 11:15:55,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:15:55,156 INFO L225 Difference]: With dead ends: 143 [2018-11-28 11:15:55,156 INFO L226 Difference]: Without dead ends: 143 [2018-11-28 11:15:55,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 44.6s TimeCoverageRelationStatistics Valid=398, Invalid=5767, Unknown=1, NotChecked=154, Total=6320 [2018-11-28 11:15:55,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-28 11:15:55,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 121. [2018-11-28 11:15:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-28 11:15:55,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2018-11-28 11:15:55,161 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 69 [2018-11-28 11:15:55,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:15:55,161 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2018-11-28 11:15:55,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-28 11:15:55,161 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2018-11-28 11:15:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 11:15:55,161 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:15:55,162 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-11-28 11:15:55,162 INFO L423 AbstractCegarLoop]: === Iteration 27 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:15:55,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:15:55,162 INFO L82 PathProgramCache]: Analyzing trace with hash 915903998, now seen corresponding path program 1 times [2018-11-28 11:15:55,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:15:55,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:15:55,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:15:55,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:15:55,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:15:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:15:55,196 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-28 11:15:55,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:15:55,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:15:55,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:15:55,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:15:55,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:15:55,197 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand 7 states. [2018-11-28 11:15:55,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:15:55,245 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-11-28 11:15:55,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:15:55,246 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-11-28 11:15:55,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:15:55,247 INFO L225 Difference]: With dead ends: 107 [2018-11-28 11:15:55,247 INFO L226 Difference]: Without dead ends: 107 [2018-11-28 11:15:55,247 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-11-28 11:15:55,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-28 11:15:55,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-28 11:15:55,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-28 11:15:55,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-11-28 11:15:55,250 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 69 [2018-11-28 11:15:55,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:15:55,250 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-11-28 11:15:55,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:15:55,250 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-11-28 11:15:55,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 11:15:55,251 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:15:55,252 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-11-28 11:15:55,252 INFO L423 AbstractCegarLoop]: === Iteration 28 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:15:55,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:15:55,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1144526287, now seen corresponding path program 1 times [2018-11-28 11:15:55,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:15:55,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:15:55,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:15:55,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:15:55,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:15:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:15:55,342 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-28 11:15:55,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:15:55,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 11:15:55,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:15:55,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:15:55,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:15:55,343 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 12 states. [2018-11-28 11:15:55,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:15:55,589 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2018-11-28 11:15:55,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 11:15:55,591 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2018-11-28 11:15:55,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:15:55,591 INFO L225 Difference]: With dead ends: 123 [2018-11-28 11:15:55,592 INFO L226 Difference]: Without dead ends: 123 [2018-11-28 11:15:55,592 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-11-28 11:15:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-28 11:15:55,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2018-11-28 11:15:55,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-28 11:15:55,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-11-28 11:15:55,595 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 91 [2018-11-28 11:15:55,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:15:55,596 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-11-28 11:15:55,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:15:55,596 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-11-28 11:15:55,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 11:15:55,597 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:15:55,597 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-11-28 11:15:55,597 INFO L423 AbstractCegarLoop]: === Iteration 29 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:15:55,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:15:55,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1144526288, now seen corresponding path program 1 times [2018-11-28 11:15:55,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:15:55,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:15:55,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:15:55,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:15:55,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:15:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:15:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-28 11:15:55,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:15:55,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 11:15:55,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:15:55,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:15:55,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:15:55,729 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 12 states. [2018-11-28 11:15:55,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:15:55,957 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-11-28 11:15:55,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 11:15:55,957 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2018-11-28 11:15:55,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:15:55,958 INFO L225 Difference]: With dead ends: 107 [2018-11-28 11:15:55,958 INFO L226 Difference]: Without dead ends: 107 [2018-11-28 11:15:55,959 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-11-28 11:15:55,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-28 11:15:55,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-28 11:15:55,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-28 11:15:55,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-11-28 11:15:55,962 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 91 [2018-11-28 11:15:55,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:15:55,962 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-11-28 11:15:55,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:15:55,962 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-11-28 11:15:55,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 11:15:55,963 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:15:55,963 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-11-28 11:15:55,964 INFO L423 AbstractCegarLoop]: === Iteration 30 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:15:55,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:15:55,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1133944862, now seen corresponding path program 1 times [2018-11-28 11:15:55,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:15:55,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:15:55,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:15:55,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:15:55,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:15:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:15:56,037 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-28 11:15:56,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:15:56,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 11:15:56,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:15:56,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:15:56,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:15:56,038 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 12 states. [2018-11-28 11:15:56,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:15:56,164 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-11-28 11:15:56,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 11:15:56,165 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-11-28 11:15:56,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:15:56,166 INFO L225 Difference]: With dead ends: 109 [2018-11-28 11:15:56,166 INFO L226 Difference]: Without dead ends: 107 [2018-11-28 11:15:56,166 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-11-28 11:15:56,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-28 11:15:56,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-28 11:15:56,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-28 11:15:56,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-11-28 11:15:56,169 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 94 [2018-11-28 11:15:56,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:15:56,171 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-11-28 11:15:56,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:15:56,172 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-11-28 11:15:56,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 11:15:56,172 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:15:56,172 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-11-28 11:15:56,173 INFO L423 AbstractCegarLoop]: === Iteration 31 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:15:56,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:15:56,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1162618541, now seen corresponding path program 1 times [2018-11-28 11:15:56,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:15:56,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:15:56,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:15:56,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:15:56,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:15:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:15:56,254 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-28 11:15:56,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:15:56,255 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:15:56,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:15:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:15:56,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:15:56,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-28 11:15:56,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-28 11:15:56,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:56,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:56,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:56,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-28 11:15:56,376 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 11:15:56,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:15:56,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 11 [2018-11-28 11:15:56,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:15:56,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:15:56,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:15:56,394 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 12 states. [2018-11-28 11:15:56,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:15:56,610 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-11-28 11:15:56,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 11:15:56,612 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-11-28 11:15:56,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:15:56,612 INFO L225 Difference]: With dead ends: 116 [2018-11-28 11:15:56,612 INFO L226 Difference]: Without dead ends: 116 [2018-11-28 11:15:56,613 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-11-28 11:15:56,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-28 11:15:56,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2018-11-28 11:15:56,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-28 11:15:56,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-11-28 11:15:56,616 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 94 [2018-11-28 11:15:56,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:15:56,616 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-11-28 11:15:56,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:15:56,616 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-11-28 11:15:56,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 11:15:56,617 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:15:56,617 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-11-28 11:15:56,617 INFO L423 AbstractCegarLoop]: === Iteration 32 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:15:56,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:15:56,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1162618540, now seen corresponding path program 1 times [2018-11-28 11:15:56,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:15:56,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:15:56,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:15:56,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:15:56,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:15:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:15:57,487 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 11:15:57,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:15:57,487 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/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-11-28 11:15:57,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:15:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:15:57,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:15:57,660 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:57,661 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:57,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:15:57,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:57,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:57,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-11-28 11:15:57,754 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-11-28 11:15:57,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:15:57,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:57,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:57,768 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-11-28 11:15:57,770 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-11-28 11:15:57,770 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:57,772 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:57,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:57,780 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-11-28 11:15:57,837 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-11-28 11:15:57,839 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-11-28 11:15:57,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:57,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:57,859 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-11-28 11:15:57,862 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-11-28 11:15:57,863 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:57,870 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:57,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:57,880 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-11-28 11:15:58,001 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:58,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11-28 11:15:58,007 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:58,008 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-11-28 11:15:58,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:58,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:58,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11-28 11:15:58,046 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:58,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-28 11:15:58,047 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:58,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:58,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:58,068 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:69 [2018-11-28 11:15:58,115 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:58,116 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:58,118 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:58,118 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-11-28 11:15:58,122 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:58,129 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-11-28 11:15:58,130 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:15:58,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:58,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:58,177 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-11-28 11:15:58,180 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:58,180 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-11-28 11:15:58,180 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:58,187 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:58,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:15:58,197 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:109, output treesize:109 [2018-11-28 11:15:59,148 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-11-28 11:15:59,152 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:59,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:59,153 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-11-28 11:15:59,165 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-11-28 11:15:59,167 INFO L267 ElimStorePlain]: Start of recursive call 3: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-11-28 11:15:59,251 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-11-28 11:15:59,252 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 11:15:59,263 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-11-28 11:15:59,264 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 11:15:59,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11-28 11:15:59,266 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:15:59,269 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:15:59,277 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-11-28 11:15:59,278 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 11:15:59,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-28 11:15:59,496 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-11-28 11:15:59,512 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-11-28 11:15:59,513 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-11-28 11:15:59,528 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:15:59,533 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-11-28 11:15:59,552 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-11-28 11:15:59,552 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-11-28 11:15:59,581 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:15:59,585 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-11-28 11:15:59,599 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-11-28 11:15:59,600 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-11-28 11:15:59,618 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:15:59,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11-28 11:15:59,635 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-11-28 11:15:59,636 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-11-28 11:15:59,652 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:15:59,742 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-11-28 11:15:59,742 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 3 variables, input treesize:132, output treesize:377 [2018-11-28 11:16:00,473 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-11-28 11:16:00,482 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-11-28 11:16:00,484 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:16:00,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:16:00,488 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-11-28 11:16:00,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:16:00,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:16:00,520 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-11-28 11:16:00,522 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:16:00,523 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:16:00,524 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-11-28 11:16:00,525 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:16:00,533 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:16:00,547 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-11-28 11:16:00,547 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:103, output treesize:59 [2018-11-28 11:16:01,634 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-11-28 11:16:01,636 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-11-28 11:16:01,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:16:01,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:16:01,671 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-11-28 11:16:01,673 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-11-28 11:16:01,673 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:16:01,677 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:16:01,691 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-11-28 11:16:01,693 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-11-28 11:16:01,694 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:16:01,699 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:16:01,709 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-11-28 11:16:01,711 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-11-28 11:16:01,711 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:16:01,714 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:16:01,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:16:01,723 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:111, output treesize:11 [2018-11-28 11:16:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2018-11-28 11:16:01,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:16:01,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 40] total 65 [2018-11-28 11:16:01,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-28 11:16:01,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-28 11:16:01,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=3821, Unknown=2, NotChecked=250, Total=4290 [2018-11-28 11:16:01,790 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 66 states. [2018-11-28 11:16:04,148 WARN L180 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2018-11-28 11:16:05,254 WARN L180 SmtUtils]: Spent 994.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2018-11-28 11:16:11,981 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2018-11-28 11:16:14,161 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 100 DAG size of output: 67 [2018-11-28 11:16:16,504 WARN L180 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 108 DAG size of output: 71 [2018-11-28 11:16:17,467 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2018-11-28 11:16:18,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:16:18,062 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-11-28 11:16:18,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-28 11:16:18,062 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 94 [2018-11-28 11:16:18,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:16:18,063 INFO L225 Difference]: With dead ends: 116 [2018-11-28 11:16:18,063 INFO L226 Difference]: Without dead ends: 116 [2018-11-28 11:16:18,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 64 SyntacticMatches, 10 SemanticMatches, 93 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2117 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=617, Invalid=7945, Unknown=2, NotChecked=366, Total=8930 [2018-11-28 11:16:18,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-28 11:16:18,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2018-11-28 11:16:18,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-28 11:16:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2018-11-28 11:16:18,068 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 94 [2018-11-28 11:16:18,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:16:18,069 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2018-11-28 11:16:18,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-28 11:16:18,069 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2018-11-28 11:16:18,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 11:16:18,070 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:16:18,070 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-11-28 11:16:18,070 INFO L423 AbstractCegarLoop]: === Iteration 33 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:16:18,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:18,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1982742195, now seen corresponding path program 1 times [2018-11-28 11:16:18,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:18,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:18,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:18,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:16:18,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:16:18,670 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 11:16:18,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:16:18,670 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/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-11-28 11:16:18,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:16:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:16:18,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:16:18,789 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:16:18,790 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:16:18,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:16:18,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:16:18,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:16:18,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-11-28 11:16:18,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, 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-11-28 11:16:18,852 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-11-28 11:16:18,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:16:18,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:16:18,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:16:18,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-28 11:16:18,901 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-11-28 11:16:18,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11-28 11:16:18,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:16:18,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:16:18,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:16:18,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-11-28 11:16:19,003 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-11-28 11:16:19,006 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-11-28 11:16:19,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:16:19,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:16:19,020 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-11-28 11:16:19,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2018-11-28 11:16:19,058 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-11-28 11:16:19,060 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:16:19,061 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-11-28 11:16:19,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:16:19,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:16:19,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:16:19,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-11-28 11:16:20,144 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-11-28 11:16:20,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:16:20,149 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:16:20,155 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-11-28 11:16:20,164 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-11-28 11:16:20,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:16:20,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:16:20,190 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-11-28 11:16:20,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:60 [2018-11-28 11:16:20,786 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-11-28 11:16:20,791 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-11-28 11:16:20,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:16:20,794 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:16:20,796 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-11-28 11:16:20,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:16:20,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:16:20,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:16:20,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:23 [2018-11-28 11:16:33,234 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 2 not checked. [2018-11-28 11:16:33,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:16:33,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 56 [2018-11-28 11:16:33,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-28 11:16:33,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-28 11:16:33,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2691, Unknown=2, NotChecked=210, Total=3080 [2018-11-28 11:16:33,254 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 56 states. [2018-11-28 11:16:55,977 WARN L180 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2018-11-28 11:17:04,178 WARN L180 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 32 DAG size of output: 20 [2018-11-28 11:17:07,173 WARN L180 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-11-28 11:17:07,644 WARN L180 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-11-28 11:17:07,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:17:07,869 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-11-28 11:17:07,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-28 11:17:07,869 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 99 [2018-11-28 11:17:07,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:17:07,870 INFO L225 Difference]: With dead ends: 112 [2018-11-28 11:17:07,870 INFO L226 Difference]: Without dead ends: 108 [2018-11-28 11:17:07,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 70 SyntacticMatches, 12 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1434 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=434, Invalid=5269, Unknown=5, NotChecked=298, Total=6006 [2018-11-28 11:17:07,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-28 11:17:07,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-11-28 11:17:07,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-28 11:17:07,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-11-28 11:17:07,875 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 99 [2018-11-28 11:17:07,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:17:07,876 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-11-28 11:17:07,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-28 11:17:07,876 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-28 11:17:07,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 11:17:07,877 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:17:07,877 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-11-28 11:17:07,877 INFO L423 AbstractCegarLoop]: === Iteration 34 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:17:07,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:17:07,878 INFO L82 PathProgramCache]: Analyzing trace with hash -561858850, now seen corresponding path program 1 times [2018-11-28 11:17:07,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:17:07,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:17:07,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:17:07,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:17:07,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:17:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:17:09,147 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 11:17:09,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:17:09,147 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/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-11-28 11:17:09,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:17:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:17:09,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:17:09,296 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:09,297 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:09,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:17:09,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:09,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:09,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-11-28 11:17:09,314 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-11-28 11:17:09,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:17:09,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:09,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:09,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:09,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-28 11:17:09,371 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-11-28 11:17:09,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11-28 11:17:09,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:09,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:09,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:09,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-11-28 11:17:09,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:17:09,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:17:09,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:09,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:09,492 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:09,494 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-11-28 11:17:09,499 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:09,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 41 [2018-11-28 11:17:09,500 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:09,509 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:09,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:09,518 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:47 [2018-11-28 11:17:09,574 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:09,578 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-11-28 11:17:09,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 11:17:09,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:09,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:09,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:09,599 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:09,601 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:09,601 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-11-28 11:17:09,606 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:09,614 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-11-28 11:17:09,615 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:17:09,635 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:09,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:09,645 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:71 [2018-11-28 11:17:11,069 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-11-28 11:17:11,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:11,076 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:11,076 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:17:11,077 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:11,079 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:11,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, 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-11-28 11:17:11,122 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-11-28 11:17:11,125 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 14 xjuncts. [2018-11-28 11:17:11,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:17:11,277 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:11,279 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:11,280 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:17:11,281 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:11,286 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-11-28 11:17:11,290 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:17:11,304 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-11-28 11:17:11,306 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 11:17:11,337 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:11,339 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:11,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:11,341 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:17:11,342 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:11,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:11,346 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-11-28 11:17:11,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:11,363 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-11-28 11:17:11,364 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:17:11,389 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:11,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:11,392 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:17:11,398 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-11-28 11:17:11,408 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-11-28 11:17:11,408 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-28 11:17:11,433 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:17:11,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:17:11,491 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:164, output treesize:203 [2018-11-28 11:17:12,686 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-11-28 11:17:12,693 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:12,697 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-11-28 11:17:12,700 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:12,702 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-11-28 11:17:12,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:12,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:12,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:12,870 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:12,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11-28 11:17:12,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:12,877 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:12,880 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:12,895 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-11-28 11:17:12,896 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:17:12,940 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:13,050 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-11-28 11:17:13,053 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:13,054 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:13,055 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:13,056 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:13,061 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-11-28 11:17:13,062 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:13,087 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:13,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:13,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:13,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:13,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 97 [2018-11-28 11:17:13,177 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:13,178 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:13,182 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:13,195 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-11-28 11:17:13,196 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:17:13,222 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:13,287 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:13,291 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:13,294 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:13,295 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-11-28 11:17:13,299 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:13,301 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:17:13,302 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:13,305 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:13,324 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-11-28 11:17:13,325 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:17:13,367 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:13,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:13,423 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:13,426 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:13,427 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-11-28 11:17:13,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:13,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:13,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:13,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:13,453 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-11-28 11:17:13,454 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:17:13,483 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:13,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:17:13,521 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 9 variables, input treesize:326, output treesize:203 [2018-11-28 11:17:14,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:14,845 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:14,846 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-11-28 11:17:14,851 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:14,860 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-11-28 11:17:14,861 INFO L267 ElimStorePlain]: Start of recursive call 3: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-11-28 11:17:14,911 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:14,928 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-11-28 11:17:14,929 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-11-28 11:17:14,959 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-11-28 11:17:14,960 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-11-28 11:17:14,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:14,980 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-11-28 11:17:14,981 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2018-11-28 11:17:14,992 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-11-28 11:17:14,993 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 11:17:15,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 11 xjuncts. [2018-11-28 11:17:15,785 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:15,786 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:15,787 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-11-28 11:17:15,790 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:15,792 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:15,798 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-11-28 11:17:15,799 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:17:15,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:17:15,813 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:15,819 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:15,821 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:15,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:15,822 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-11-28 11:17:15,833 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-11-28 11:17:15,834 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-28 11:17:15,851 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:15,852 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:15,853 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-11-28 11:17:15,853 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:15,860 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:15,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:15,863 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:15,863 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-11-28 11:17:15,874 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-11-28 11:17:15,875 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-28 11:17:15,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:15,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:15,892 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-11-28 11:17:15,892 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:15,898 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:15,901 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-11-28 11:17:15,903 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:15,904 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-11-28 11:17:15,905 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:15,916 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-11-28 11:17:15,917 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-11-28 11:17:15,923 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:17:15,925 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:15,926 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:15,927 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-11-28 11:17:15,940 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-11-28 11:17:15,941 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-28 11:17:15,954 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:15,955 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:15,955 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-11-28 11:17:15,956 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:15,962 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:15,964 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:15,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:15,966 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-11-28 11:17:15,978 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-11-28 11:17:15,979 INFO L267 ElimStorePlain]: Start of recursive call 24: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-28 11:17:15,992 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:15,993 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:15,993 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-11-28 11:17:15,994 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:16,005 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:16,007 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:16,008 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:16,009 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-11-28 11:17:16,012 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:16,014 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:16,021 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-11-28 11:17:16,022 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:17:16,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:17:16,035 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:16,041 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:16,043 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-11-28 11:17:16,048 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-11-28 11:17:16,049 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-11-28 11:17:16,061 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:16,063 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-11-28 11:17:16,063 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:16,071 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:17:16,073 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:16,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:16,074 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-11-28 11:17:16,085 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-11-28 11:17:16,086 INFO L267 ElimStorePlain]: Start of recursive call 33: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-28 11:17:16,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:16,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:16,104 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-11-28 11:17:16,104 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:16,111 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:16,114 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-11-28 11:17:16,116 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:16,117 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-11-28 11:17:16,117 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:16,129 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-11-28 11:17:16,130 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-11-28 11:17:16,137 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:17:16,139 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-11-28 11:17:16,145 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-11-28 11:17:16,145 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-11-28 11:17:16,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:16,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11-28 11:17:16,158 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:16,166 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:17:16,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-28 11:17:16,358 INFO L202 ElimStorePlain]: Needed 40 recursive calls to eliminate 6 variables, input treesize:299, output treesize:58 [2018-11-28 11:17:16,685 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 2 not checked. [2018-11-28 11:17:16,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:17:16,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 38] total 61 [2018-11-28 11:17:16,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-28 11:17:16,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-28 11:17:16,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3256, Unknown=3, NotChecked=230, Total=3660 [2018-11-28 11:17:16,705 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 61 states. [2018-11-28 11:17:21,135 WARN L180 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 62 DAG size of output: 32 [2018-11-28 11:17:23,437 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 59 DAG size of output: 28 [2018-11-28 11:17:24,036 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-11-28 11:17:24,296 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-11-28 11:17:24,548 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-11-28 11:17:24,907 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 105 [2018-11-28 11:17:25,250 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 105 [2018-11-28 11:17:25,619 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2018-11-28 11:17:26,021 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2018-11-28 11:17:26,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:17:26,113 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2018-11-28 11:17:26,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-28 11:17:26,113 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 99 [2018-11-28 11:17:26,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:17:26,114 INFO L225 Difference]: With dead ends: 101 [2018-11-28 11:17:26,114 INFO L226 Difference]: Without dead ends: 101 [2018-11-28 11:17:26,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 66 SyntacticMatches, 13 SemanticMatches, 85 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1424 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=484, Invalid=6661, Unknown=3, NotChecked=334, Total=7482 [2018-11-28 11:17:26,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-28 11:17:26,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-11-28 11:17:26,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-28 11:17:26,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2018-11-28 11:17:26,117 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 99 [2018-11-28 11:17:26,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:17:26,117 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2018-11-28 11:17:26,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-11-28 11:17:26,117 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2018-11-28 11:17:26,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-28 11:17:26,118 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:17:26,118 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-11-28 11:17:26,118 INFO L423 AbstractCegarLoop]: === Iteration 35 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:17:26,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:17:26,118 INFO L82 PathProgramCache]: Analyzing trace with hash -237756565, now seen corresponding path program 1 times [2018-11-28 11:17:26,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:17:26,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:17:26,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:17:26,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:17:26,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:17:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:17:26,756 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 11:17:26,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:17:26,756 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/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-11-28 11:17:26,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:17:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:17:26,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:17:26,927 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:26,927 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-11-28 11:17:26,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:26,941 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:26,946 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-11-28 11:17:26,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:17:26,960 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-11-28 11:17:26,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:38 [2018-11-28 11:17:27,040 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-28 11:17:27,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:17:27,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 7] total 36 [2018-11-28 11:17:27,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-28 11:17:27,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-28 11:17:27,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1231, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 11:17:27,060 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 37 states. [2018-11-28 11:17:28,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:17:28,103 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-11-28 11:17:28,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-28 11:17:28,104 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 100 [2018-11-28 11:17:28,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:17:28,105 INFO L225 Difference]: With dead ends: 100 [2018-11-28 11:17:28,105 INFO L226 Difference]: Without dead ends: 100 [2018-11-28 11:17:28,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 95 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=283, Invalid=2687, Unknown=0, NotChecked=0, Total=2970 [2018-11-28 11:17:28,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-28 11:17:28,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-11-28 11:17:28,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-28 11:17:28,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2018-11-28 11:17:28,108 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 100 [2018-11-28 11:17:28,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:17:28,108 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2018-11-28 11:17:28,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-28 11:17:28,109 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2018-11-28 11:17:28,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 11:17:28,109 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:17:28,109 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-11-28 11:17:28,110 INFO L423 AbstractCegarLoop]: === Iteration 36 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 11:17:28,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:17:28,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1560894814, now seen corresponding path program 1 times [2018-11-28 11:17:28,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:17:28,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:17:28,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:17:28,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:17:28,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:17:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:17:29,241 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 11:17:29,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:17:29,241 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/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-11-28 11:17:29,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:17:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:17:29,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:17:29,475 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:29,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:29,477 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-11-28 11:17:29,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:29,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:29,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:34 [2018-11-28 11:17:29,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 11:17:29,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 8 treesize of output 7 [2018-11-28 11:17:29,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:29,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:29,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:29,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-11-28 11:17:29,651 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-11-28 11:17:29,652 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-11-28 11:17:29,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:29,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:29,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:17:29,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:47 [2018-11-28 11:17:29,793 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-11-28 11:17:29,797 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-11-28 11:17:29,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:29,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:29,814 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-11-28 11:17:29,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2018-11-28 11:17:29,874 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-11-28 11:17:29,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:29,877 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-11-28 11:17:29,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:29,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:29,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:17:29,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:69 [2018-11-28 11:17:30,180 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-11-28 11:17:30,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:30,193 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-11-28 11:17:30,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-28 11:17:30,195 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:30,200 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:30,201 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-11-28 11:17:30,202 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:17:30,206 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:17:30,213 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-11-28 11:17:30,213 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:72, output treesize:18 [2018-11-28 11:17:37,896 WARN L180 SmtUtils]: Spent 725.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 11:17:37,903 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-11-28 11:17:37,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, 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-11-28 11:17:37,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:17:37,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:17:37,947 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-11-28 11:17:37,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:114, output treesize:156 [2018-11-28 11:17:38,038 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-11-28 11:17:38,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:38,046 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-11-28 11:17:38,047 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:38,047 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-11-28 11:17:38,048 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:17:38,051 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:17:38,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:17:38,056 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:59, output treesize:18 [2018-11-28 11:17:45,865 WARN L180 SmtUtils]: Spent 655.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 11:17:45,872 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-11-28 11:17:45,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:45,875 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:45,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:17:45,878 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-11-28 11:17:45,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:45,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:17:45,903 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-11-28 11:17:45,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:92, output treesize:70 [2018-11-28 11:17:45,974 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-11-28 11:17:45,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:45,982 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-11-28 11:17:45,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:42 [2018-11-28 11:17:46,166 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-11-28 11:17:46,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:46,174 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-11-28 11:17:46,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:42 [2018-11-28 11:17:46,265 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-11-28 11:17:46,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:46,286 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-11-28 11:17:46,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:17:46,298 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-11-28 11:17:46,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:31 [2018-11-28 11:17:48,784 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2018-11-28 11:18:03,157 WARN L180 SmtUtils]: Spent 2.43 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-28 11:18:05,163 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-11-28 11:18:05,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:18:05,170 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:18:05,171 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:18:05,171 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-11-28 11:18:05,174 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-11-28 11:18:05,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:18:05,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:18:05,206 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-11-28 11:18:05,208 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:18:05,209 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:18:05,209 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-11-28 11:18:05,210 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:18:05,232 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:18:05,233 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-11-28 11:18:05,234 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:18:05,248 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:18:05,248 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:18:05,248 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:18:05,249 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-11-28 11:18:05,249 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:18:05,263 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:18:05,282 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-11-28 11:18:05,282 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:102, output treesize:51 [2018-11-28 11:18:05,415 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 12 refuted. 2 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 11:18:05,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:18:05,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 36] total 65 [2018-11-28 11:18:05,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-28 11:18:05,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-28 11:18:05,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=3912, Unknown=31, NotChecked=126, Total=4290 [2018-11-28 11:18:05,432 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand 66 states. [2018-11-28 11:18:32,195 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2018-11-28 11:18:38,404 WARN L180 SmtUtils]: Spent 5.18 s on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2018-11-28 11:18:45,004 WARN L180 SmtUtils]: Spent 5.33 s on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2018-11-28 11:18:49,779 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2018-11-28 11:18:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:18:49,780 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2018-11-28 11:18:49,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-28 11:18:49,780 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 104 [2018-11-28 11:18:49,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:18:49,781 INFO L225 Difference]: With dead ends: 99 [2018-11-28 11:18:49,781 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 11:18:49,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 78 SyntacticMatches, 8 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1925 ImplicationChecksByTransitivity, 60.2s TimeCoverageRelationStatistics Valid=494, Invalid=7482, Unknown=38, NotChecked=176, Total=8190 [2018-11-28 11:18:49,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 11:18:49,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 11:18:49,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 11:18:49,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 11:18:49,782 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2018-11-28 11:18:49,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:18:49,782 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:18:49,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-28 11:18:49,782 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:18:49,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 11:18:49,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:18:49 BoogieIcfgContainer [2018-11-28 11:18:49,786 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:18:49,786 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:18:49,786 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:18:49,786 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:18:49,787 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:14:18" (3/4) ... [2018-11-28 11:18:49,791 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 11:18:49,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 11:18:49,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-11-28 11:18:49,799 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_destroy [2018-11-28 11:18:49,799 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-28 11:18:49,799 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-28 11:18:49,799 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 11:18:49,799 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_create [2018-11-28 11:18:49,799 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_update_at [2018-11-28 11:18:49,800 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-11-28 11:18:49,800 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_get_data_at [2018-11-28 11:18:49,808 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2018-11-28 11:18:49,809 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-28 11:18:49,809 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 11:18:49,846 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_dc528136-fba9-4406-a2f3-88975a4a5891/bin-2019/uautomizer/witness.graphml [2018-11-28 11:18:49,846 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:18:49,847 INFO L168 Benchmark]: Toolchain (without parser) took 272001.39 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 260.6 MB). Free memory was 950.6 MB in the beginning and 955.4 MB in the end (delta: -4.8 MB). Peak memory consumption was 255.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:18:49,847 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:18:49,847 INFO L168 Benchmark]: CACSL2BoogieTranslator took 366.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-28 11:18:49,847 INFO L168 Benchmark]: Boogie Preprocessor took 46.39 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.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:18:49,848 INFO L168 Benchmark]: RCFGBuilder took 470.14 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: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:18:49,848 INFO L168 Benchmark]: TraceAbstraction took 271054.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.3 MB). Free memory was 1.0 GB in the beginning and 955.4 MB in the end (delta: 90.4 MB). Peak memory consumption was 226.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:18:49,848 INFO L168 Benchmark]: Witness Printer took 59.60 ms. Allocated memory is still 1.3 GB. Free memory was 955.4 MB in the beginning and 955.4 MB in the end (delta: 7.5 kB). Peak memory consumption was 7.5 kB. Max. memory is 11.5 GB. [2018-11-28 11:18:49,849 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.18 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 366.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.39 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.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 470.14 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: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 271054.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.3 MB). Free memory was 1.0 GB in the beginning and 955.4 MB in the end (delta: 90.4 MB). Peak memory consumption was 226.7 MB. Max. memory is 11.5 GB. * Witness Printer took 59.60 ms. Allocated memory is still 1.3 GB. Free memory was 955.4 MB in the beginning and 955.4 MB in the end (delta: 7.5 kB). Peak memory consumption was 7.5 kB. 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: 598]: free always succeeds For all program executions holds that free 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: 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: 595]: free always succeeds For all program executions holds that free 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: 579]: 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: 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: 586]: 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: 581]: 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: 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: 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: 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: 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 - 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, 271.0s OverallTime, 36 OverallIterations, 3 TraceHistogramMax, 168.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2710 SDtfs, 2753 SDslu, 15576 SDs, 0 SdLazy, 25954 SolverSat, 775 SolverUnsat, 58 SolverUnknown, 0 SolverNotchecked, 72.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1836 GetRequests, 845 SyntacticMatches, 95 SemanticMatches, 896 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 10553 ImplicationChecksByTransitivity, 186.0s 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.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 100.2s 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...