./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/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 ed4d18349810257ce078dfe4f08b9b953ed4516f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:14:31,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:14:31,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:14:31,115 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:14:31,115 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:14:31,116 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:14:31,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:14:31,118 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:14:31,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:14:31,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:14:31,121 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:14:31,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:14:31,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:14:31,122 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:14:31,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:14:31,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:14:31,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:14:31,125 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:14:31,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:14:31,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:14:31,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:14:31,130 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:14:31,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:14:31,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:14:31,133 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:14:31,133 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:14:31,133 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:14:31,133 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:14:31,134 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:14:31,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:14:31,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:14:31,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:14:31,135 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:14:31,136 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:14:31,136 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:14:31,136 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:14:31,137 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:14:31,137 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:14:31,137 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:14:31,137 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:14:31,138 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:14:31,138 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 17:14:31,147 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:14:31,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:14:31,148 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:14:31,148 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:14:31,148 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:14:31,148 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:14:31,148 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:14:31,149 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 17:14:31,149 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:14:31,149 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:14:31,149 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:14:31,149 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 17:14:31,149 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 17:14:31,149 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 17:14:31,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:14:31,149 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 17:14:31,149 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:14:31,150 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:14:31,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:14:31,150 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:14:31,150 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:14:31,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:14:31,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:14:31,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:14:31,150 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:14:31,151 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:14:31,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:14:31,151 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:14:31,151 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/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 -> ed4d18349810257ce078dfe4f08b9b953ed4516f [2019-12-07 17:14:31,251 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:14:31,261 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:14:31,264 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:14:31,265 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:14:31,265 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:14:31,266 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/../../sv-benchmarks/c/list-simple/dll2c_update_all.i [2019-12-07 17:14:31,310 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/data/dd22cc7a3/6122c1710379422a8e7081ca38900b8a/FLAG5f69913a1 [2019-12-07 17:14:31,811 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:14:31,812 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/sv-benchmarks/c/list-simple/dll2c_update_all.i [2019-12-07 17:14:31,821 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/data/dd22cc7a3/6122c1710379422a8e7081ca38900b8a/FLAG5f69913a1 [2019-12-07 17:14:32,288 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/data/dd22cc7a3/6122c1710379422a8e7081ca38900b8a [2019-12-07 17:14:32,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:14:32,292 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 17:14:32,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:14:32,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:14:32,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:14:32,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:14:32" (1/1) ... [2019-12-07 17:14:32,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79b51c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:32, skipping insertion in model container [2019-12-07 17:14:32,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:14:32" (1/1) ... [2019-12-07 17:14:32,307 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:14:32,335 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:14:32,542 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:14:32,549 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:14:32,579 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:14:32,612 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:14:32,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:32 WrapperNode [2019-12-07 17:14:32,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:14:32,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:14:32,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:14:32,613 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:14:32,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:32" (1/1) ... [2019-12-07 17:14:32,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:32" (1/1) ... [2019-12-07 17:14:32,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:32" (1/1) ... [2019-12-07 17:14:32,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:32" (1/1) ... [2019-12-07 17:14:32,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:32" (1/1) ... [2019-12-07 17:14:32,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:32" (1/1) ... [2019-12-07 17:14:32,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:32" (1/1) ... [2019-12-07 17:14:32,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:14:32,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:14:32,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:14:32,654 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:14:32,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/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 [2019-12-07 17:14:32,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 17:14:32,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:14:32,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 17:14:32,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 17:14:32,693 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-12-07 17:14:32,693 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-12-07 17:14:32,693 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-12-07 17:14:32,693 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2019-12-07 17:14:32,693 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2019-12-07 17:14:32,693 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2019-12-07 17:14:32,693 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 17:14:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 17:14:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 17:14:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 17:14:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 17:14:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 17:14:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 17:14:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 17:14:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 17:14:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 17:14:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 17:14:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 17:14:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 17:14:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 17:14:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 17:14:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 17:14:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 17:14:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 17:14:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 17:14:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 17:14:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 17:14:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 17:14:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 17:14:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 17:14:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 17:14:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 17:14:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 17:14:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 17:14:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 17:14:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 17:14:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 17:14:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 17:14:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 17:14:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 17:14:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 17:14:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 17:14:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 17:14:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 17:14:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 17:14:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 17:14:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 17:14:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 17:14:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 17:14:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 17:14:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 17:14:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 17:14:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 17:14:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 17:14:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 17:14:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 17:14:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 17:14:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 17:14:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 17:14:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 17:14:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 17:14:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 17:14:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 17:14:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 17:14:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-12-07 17:14:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 17:14:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 17:14:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 17:14:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 17:14:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 17:14:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 17:14:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 17:14:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 17:14:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 17:14:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 17:14:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 17:14:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 17:14:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 17:14:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 17:14:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 17:14:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 17:14:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 17:14:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 17:14:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 17:14:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 17:14:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 17:14:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 17:14:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 17:14:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 17:14:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 17:14:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 17:14:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 17:14:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 17:14:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 17:14:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 17:14:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 17:14:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 17:14:32,701 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 17:14:32,701 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 17:14:32,701 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 17:14:32,701 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 17:14:32,701 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 17:14:32,701 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 17:14:32,701 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 17:14:32,701 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 17:14:32,701 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 17:14:32,701 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 17:14:32,701 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 17:14:32,701 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 17:14:32,701 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 17:14:32,701 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 17:14:32,701 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 17:14:32,702 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 17:14:32,702 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-12-07 17:14:32,702 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-12-07 17:14:32,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 17:14:32,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 17:14:32,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:14:32,702 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-12-07 17:14:32,702 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2019-12-07 17:14:32,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 17:14:32,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:14:32,702 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2019-12-07 17:14:32,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 17:14:32,702 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2019-12-07 17:14:32,702 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 17:14:32,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 17:14:32,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:14:32,941 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-12-07 17:14:33,035 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:14:33,035 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-07 17:14:33,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:14:33 BoogieIcfgContainer [2019-12-07 17:14:33,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:14:33,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:14:33,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:14:33,038 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:14:33,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:14:32" (1/3) ... [2019-12-07 17:14:33,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ca3eee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:14:33, skipping insertion in model container [2019-12-07 17:14:33,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:32" (2/3) ... [2019-12-07 17:14:33,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ca3eee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:14:33, skipping insertion in model container [2019-12-07 17:14:33,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:14:33" (3/3) ... [2019-12-07 17:14:33,040 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2019-12-07 17:14:33,047 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:14:33,052 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 34 error locations. [2019-12-07 17:14:33,059 INFO L249 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2019-12-07 17:14:33,071 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:14:33,071 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 17:14:33,072 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:14:33,072 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:14:33,072 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:14:33,072 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:14:33,072 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:14:33,072 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:14:33,085 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2019-12-07 17:14:33,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 17:14:33,090 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:33,091 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:33,091 INFO L410 AbstractCegarLoop]: === Iteration 1 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:14:33,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:33,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1377994719, now seen corresponding path program 1 times [2019-12-07 17:14:33,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:33,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647482240] [2019-12-07 17:14:33,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:33,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:33,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647482240] [2019-12-07 17:14:33,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:33,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:14:33,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804472634] [2019-12-07 17:14:33,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:14:33,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:33,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:14:33,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:14:33,243 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 4 states. [2019-12-07 17:14:33,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:33,461 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2019-12-07 17:14:33,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:14:33,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 17:14:33,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:33,472 INFO L225 Difference]: With dead ends: 130 [2019-12-07 17:14:33,472 INFO L226 Difference]: Without dead ends: 124 [2019-12-07 17:14:33,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:14:33,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-12-07 17:14:33,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 105. [2019-12-07 17:14:33,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-07 17:14:33,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2019-12-07 17:14:33,511 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 12 [2019-12-07 17:14:33,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:33,511 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2019-12-07 17:14:33,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:14:33,511 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2019-12-07 17:14:33,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 17:14:33,511 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:33,511 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:33,512 INFO L410 AbstractCegarLoop]: === Iteration 2 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:14:33,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:33,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1377994718, now seen corresponding path program 1 times [2019-12-07 17:14:33,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:33,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303150616] [2019-12-07 17:14:33,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:33,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:33,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303150616] [2019-12-07 17:14:33,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:33,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:14:33,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617776800] [2019-12-07 17:14:33,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:14:33,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:33,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:14:33,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:14:33,572 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand 4 states. [2019-12-07 17:14:33,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:33,720 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2019-12-07 17:14:33,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:14:33,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 17:14:33,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:33,722 INFO L225 Difference]: With dead ends: 121 [2019-12-07 17:14:33,722 INFO L226 Difference]: Without dead ends: 121 [2019-12-07 17:14:33,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:14:33,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-12-07 17:14:33,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2019-12-07 17:14:33,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 17:14:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2019-12-07 17:14:33,730 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 12 [2019-12-07 17:14:33,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:33,731 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2019-12-07 17:14:33,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:14:33,731 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2019-12-07 17:14:33,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:14:33,731 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:33,732 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:33,732 INFO L410 AbstractCegarLoop]: === Iteration 3 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:14:33,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:33,732 INFO L82 PathProgramCache]: Analyzing trace with hash 379609462, now seen corresponding path program 1 times [2019-12-07 17:14:33,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:33,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072701789] [2019-12-07 17:14:33,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:33,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:33,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072701789] [2019-12-07 17:14:33,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:33,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:14:33,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650114710] [2019-12-07 17:14:33,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:14:33,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:33,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:14:33,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:14:33,817 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 7 states. [2019-12-07 17:14:34,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:34,118 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2019-12-07 17:14:34,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:14:34,118 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-12-07 17:14:34,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:34,119 INFO L225 Difference]: With dead ends: 122 [2019-12-07 17:14:34,119 INFO L226 Difference]: Without dead ends: 122 [2019-12-07 17:14:34,120 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:14:34,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-12-07 17:14:34,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 103. [2019-12-07 17:14:34,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-12-07 17:14:34,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-12-07 17:14:34,127 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 20 [2019-12-07 17:14:34,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:34,128 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-12-07 17:14:34,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:14:34,128 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-12-07 17:14:34,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 17:14:34,128 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:34,129 INFO L410 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] [2019-12-07 17:14:34,129 INFO L410 AbstractCegarLoop]: === Iteration 4 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:14:34,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:34,129 INFO L82 PathProgramCache]: Analyzing trace with hash -450848534, now seen corresponding path program 1 times [2019-12-07 17:14:34,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:34,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436303314] [2019-12-07 17:14:34,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:34,258 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:14:34,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436303314] [2019-12-07 17:14:34,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:34,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:14:34,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610338674] [2019-12-07 17:14:34,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:14:34,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:34,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:14:34,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:14:34,260 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 9 states. [2019-12-07 17:14:34,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:34,545 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2019-12-07 17:14:34,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:14:34,545 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-12-07 17:14:34,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:34,546 INFO L225 Difference]: With dead ends: 122 [2019-12-07 17:14:34,546 INFO L226 Difference]: Without dead ends: 122 [2019-12-07 17:14:34,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:14:34,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-12-07 17:14:34,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 102. [2019-12-07 17:14:34,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 17:14:34,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2019-12-07 17:14:34,552 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 30 [2019-12-07 17:14:34,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:34,553 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2019-12-07 17:14:34,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:14:34,553 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2019-12-07 17:14:34,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 17:14:34,553 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:34,553 INFO L410 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] [2019-12-07 17:14:34,554 INFO L410 AbstractCegarLoop]: === Iteration 5 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:14:34,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:34,554 INFO L82 PathProgramCache]: Analyzing trace with hash -450848535, now seen corresponding path program 1 times [2019-12-07 17:14:34,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:34,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999994059] [2019-12-07 17:14:34,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:34,621 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:14:34,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999994059] [2019-12-07 17:14:34,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:34,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:14:34,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674828655] [2019-12-07 17:14:34,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:14:34,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:34,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:14:34,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:14:34,623 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 8 states. [2019-12-07 17:14:34,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:34,922 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2019-12-07 17:14:34,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:14:34,923 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-12-07 17:14:34,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:34,924 INFO L225 Difference]: With dead ends: 121 [2019-12-07 17:14:34,924 INFO L226 Difference]: Without dead ends: 121 [2019-12-07 17:14:34,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:14:34,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-12-07 17:14:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 101. [2019-12-07 17:14:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-12-07 17:14:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-12-07 17:14:34,930 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 30 [2019-12-07 17:14:34,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:34,931 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-12-07 17:14:34,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:14:34,931 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-12-07 17:14:34,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 17:14:34,932 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:34,932 INFO L410 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] [2019-12-07 17:14:34,932 INFO L410 AbstractCegarLoop]: === Iteration 6 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:14:34,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:34,933 INFO L82 PathProgramCache]: Analyzing trace with hash 526254410, now seen corresponding path program 1 times [2019-12-07 17:14:34,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:34,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203928117] [2019-12-07 17:14:34,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:35,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:14:35,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203928117] [2019-12-07 17:14:35,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674646359] [2019-12-07 17:14:35,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:14:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:35,134 INFO L264 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 17:14:35,138 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:35,220 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:14:35,230 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:14:35,230 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 23 [2019-12-07 17:14:35,231 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:14:35,242 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 17:14:35,242 INFO L534 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. [2019-12-07 17:14:35,243 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-12-07 17:14:35,251 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:35,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:14:35,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-12-07 17:14:35,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154961145] [2019-12-07 17:14:35,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:14:35,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:35,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:14:35,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:14:35,252 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 12 states. [2019-12-07 17:14:35,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:35,837 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2019-12-07 17:14:35,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:14:35,837 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-12-07 17:14:35,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:35,838 INFO L225 Difference]: With dead ends: 142 [2019-12-07 17:14:35,838 INFO L226 Difference]: Without dead ends: 142 [2019-12-07 17:14:35,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:14:35,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-12-07 17:14:35,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 106. [2019-12-07 17:14:35,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 17:14:35,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2019-12-07 17:14:35,844 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 32 [2019-12-07 17:14:35,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:35,844 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2019-12-07 17:14:35,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:14:35,844 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2019-12-07 17:14:35,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 17:14:35,845 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:35,845 INFO L410 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] [2019-12-07 17:14:36,045 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:14:36,047 INFO L410 AbstractCegarLoop]: === Iteration 7 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:14:36,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:36,048 INFO L82 PathProgramCache]: Analyzing trace with hash 526254411, now seen corresponding path program 1 times [2019-12-07 17:14:36,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:36,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834760424] [2019-12-07 17:14:36,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:14:36,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834760424] [2019-12-07 17:14:36,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080779478] [2019-12-07 17:14:36,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:14:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:36,307 INFO L264 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 17:14:36,310 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:36,316 INFO L377 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 [2019-12-07 17:14:36,316 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:14:36,319 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:14:36,319 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:14:36,319 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 17:14:36,381 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:14:36,382 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-12-07 17:14:36,382 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:14:36,393 INFO L614 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-12-07 17:14:36,394 INFO L534 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. [2019-12-07 17:14:36,394 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-12-07 17:14:36,399 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:36,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:14:36,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-12-07 17:14:36,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229359697] [2019-12-07 17:14:36,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:14:36,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:36,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:14:36,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:14:36,401 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand 12 states. [2019-12-07 17:14:36,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:36,863 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2019-12-07 17:14:36,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:14:36,863 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-12-07 17:14:36,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:36,864 INFO L225 Difference]: With dead ends: 127 [2019-12-07 17:14:36,864 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 17:14:36,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:14:36,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 17:14:36,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 106. [2019-12-07 17:14:36,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 17:14:36,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2019-12-07 17:14:36,869 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 32 [2019-12-07 17:14:36,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:36,869 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2019-12-07 17:14:36,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:14:36,869 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2019-12-07 17:14:36,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 17:14:36,870 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:36,870 INFO L410 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] [2019-12-07 17:14:37,071 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:14:37,071 INFO L410 AbstractCegarLoop]: === Iteration 8 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:14:37,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:37,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1075498847, now seen corresponding path program 1 times [2019-12-07 17:14:37,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:37,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827176028] [2019-12-07 17:14:37,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:37,157 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:14:37,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827176028] [2019-12-07 17:14:37,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703955284] [2019-12-07 17:14:37,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:14:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:37,251 INFO L264 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 17:14:37,254 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:37,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:14:37,289 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:14:37,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:14:37,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-12-07 17:14:37,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301693459] [2019-12-07 17:14:37,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:14:37,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:37,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:14:37,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:14:37,290 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 10 states. [2019-12-07 17:14:37,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:37,567 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2019-12-07 17:14:37,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:14:37,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-12-07 17:14:37,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:37,568 INFO L225 Difference]: With dead ends: 126 [2019-12-07 17:14:37,569 INFO L226 Difference]: Without dead ends: 126 [2019-12-07 17:14:37,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:14:37,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-12-07 17:14:37,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 106. [2019-12-07 17:14:37,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 17:14:37,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2019-12-07 17:14:37,572 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 34 [2019-12-07 17:14:37,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:37,573 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2019-12-07 17:14:37,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:14:37,573 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2019-12-07 17:14:37,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 17:14:37,573 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:37,574 INFO L410 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] [2019-12-07 17:14:37,774 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:14:37,775 INFO L410 AbstractCegarLoop]: === Iteration 9 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:14:37,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:37,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1014493416, now seen corresponding path program 1 times [2019-12-07 17:14:37,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:37,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786037530] [2019-12-07 17:14:37,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:37,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:14:37,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786037530] [2019-12-07 17:14:37,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421003866] [2019-12-07 17:14:37,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:14:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:38,008 INFO L264 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 17:14:38,010 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:14:38,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:14:38,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 10 [2019-12-07 17:14:38,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708210865] [2019-12-07 17:14:38,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:14:38,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:38,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:14:38,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:14:38,020 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand 11 states. [2019-12-07 17:14:38,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:38,485 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2019-12-07 17:14:38,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:14:38,486 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-12-07 17:14:38,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:38,489 INFO L225 Difference]: With dead ends: 136 [2019-12-07 17:14:38,490 INFO L226 Difference]: Without dead ends: 136 [2019-12-07 17:14:38,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:14:38,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-12-07 17:14:38,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 109. [2019-12-07 17:14:38,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 17:14:38,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2019-12-07 17:14:38,501 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 35 [2019-12-07 17:14:38,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:38,502 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2019-12-07 17:14:38,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:14:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2019-12-07 17:14:38,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 17:14:38,505 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:38,505 INFO L410 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] [2019-12-07 17:14:38,706 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:14:38,707 INFO L410 AbstractCegarLoop]: === Iteration 10 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:14:38,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:38,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1014493415, now seen corresponding path program 1 times [2019-12-07 17:14:38,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:38,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789751029] [2019-12-07 17:14:38,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:38,804 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 17:14:38,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789751029] [2019-12-07 17:14:38,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741115917] [2019-12-07 17:14:38,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:14:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:38,875 INFO L264 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:14:38,876 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 17:14:38,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:14:38,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 6 [2019-12-07 17:14:38,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217886671] [2019-12-07 17:14:38,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:14:38,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:38,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:14:38,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:14:38,880 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 7 states. [2019-12-07 17:14:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:39,094 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2019-12-07 17:14:39,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:14:39,095 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-07 17:14:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:39,096 INFO L225 Difference]: With dead ends: 129 [2019-12-07 17:14:39,096 INFO L226 Difference]: Without dead ends: 129 [2019-12-07 17:14:39,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:14:39,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-12-07 17:14:39,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 109. [2019-12-07 17:14:39,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 17:14:39,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2019-12-07 17:14:39,101 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 35 [2019-12-07 17:14:39,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:39,101 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2019-12-07 17:14:39,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:14:39,101 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2019-12-07 17:14:39,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 17:14:39,102 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:39,102 INFO L410 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] [2019-12-07 17:14:39,302 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:14:39,303 INFO L410 AbstractCegarLoop]: === Iteration 11 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:14:39,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:39,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1384524796, now seen corresponding path program 1 times [2019-12-07 17:14:39,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:39,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807048986] [2019-12-07 17:14:39,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:39,372 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:14:39,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807048986] [2019-12-07 17:14:39,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:39,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:14:39,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940287999] [2019-12-07 17:14:39,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:14:39,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:39,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:14:39,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:14:39,373 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand 9 states. [2019-12-07 17:14:39,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:39,674 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2019-12-07 17:14:39,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:14:39,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-07 17:14:39,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:39,675 INFO L225 Difference]: With dead ends: 128 [2019-12-07 17:14:39,675 INFO L226 Difference]: Without dead ends: 128 [2019-12-07 17:14:39,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:14:39,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-07 17:14:39,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 108. [2019-12-07 17:14:39,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-12-07 17:14:39,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2019-12-07 17:14:39,678 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 36 [2019-12-07 17:14:39,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:39,678 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2019-12-07 17:14:39,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:14:39,678 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2019-12-07 17:14:39,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 17:14:39,679 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:39,679 INFO L410 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] [2019-12-07 17:14:39,679 INFO L410 AbstractCegarLoop]: === Iteration 12 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:14:39,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:39,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1384524797, now seen corresponding path program 1 times [2019-12-07 17:14:39,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:39,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022303916] [2019-12-07 17:14:39,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:14:39,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022303916] [2019-12-07 17:14:39,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:39,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:14:39,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823254264] [2019-12-07 17:14:39,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:14:39,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:39,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:14:39,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:14:39,788 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 10 states. [2019-12-07 17:14:40,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:40,092 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2019-12-07 17:14:40,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:14:40,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-12-07 17:14:40,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:40,094 INFO L225 Difference]: With dead ends: 126 [2019-12-07 17:14:40,094 INFO L226 Difference]: Without dead ends: 126 [2019-12-07 17:14:40,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:14:40,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-12-07 17:14:40,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2019-12-07 17:14:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 17:14:40,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2019-12-07 17:14:40,097 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 36 [2019-12-07 17:14:40,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:40,097 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2019-12-07 17:14:40,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:14:40,097 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2019-12-07 17:14:40,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 17:14:40,098 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:40,098 INFO L410 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] [2019-12-07 17:14:40,098 INFO L410 AbstractCegarLoop]: === Iteration 13 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:14:40,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:40,098 INFO L82 PathProgramCache]: Analyzing trace with hash -65422212, now seen corresponding path program 1 times [2019-12-07 17:14:40,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:40,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72904131] [2019-12-07 17:14:40,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:40,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:14:40,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72904131] [2019-12-07 17:14:40,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:40,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 17:14:40,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890928635] [2019-12-07 17:14:40,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 17:14:40,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:40,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 17:14:40,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:14:40,235 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand 14 states. [2019-12-07 17:14:40,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:40,762 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2019-12-07 17:14:40,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:14:40,762 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2019-12-07 17:14:40,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:40,763 INFO L225 Difference]: With dead ends: 135 [2019-12-07 17:14:40,763 INFO L226 Difference]: Without dead ends: 135 [2019-12-07 17:14:40,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-12-07 17:14:40,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-12-07 17:14:40,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 110. [2019-12-07 17:14:40,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 17:14:40,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2019-12-07 17:14:40,767 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 45 [2019-12-07 17:14:40,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:40,767 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2019-12-07 17:14:40,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 17:14:40,767 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2019-12-07 17:14:40,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 17:14:40,768 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:40,768 INFO L410 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] [2019-12-07 17:14:40,768 INFO L410 AbstractCegarLoop]: === Iteration 14 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:14:40,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:40,769 INFO L82 PathProgramCache]: Analyzing trace with hash -65422211, now seen corresponding path program 1 times [2019-12-07 17:14:40,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:40,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185255449] [2019-12-07 17:14:40,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:40,971 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:14:40,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185255449] [2019-12-07 17:14:40,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:40,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 17:14:40,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032560183] [2019-12-07 17:14:40,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 17:14:40,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:40,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 17:14:40,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:14:40,972 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand 15 states. [2019-12-07 17:14:42,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:42,141 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2019-12-07 17:14:42,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:14:42,141 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2019-12-07 17:14:42,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:42,142 INFO L225 Difference]: With dead ends: 132 [2019-12-07 17:14:42,142 INFO L226 Difference]: Without dead ends: 132 [2019-12-07 17:14:42,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-12-07 17:14:42,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-12-07 17:14:42,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 110. [2019-12-07 17:14:42,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 17:14:42,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-12-07 17:14:42,145 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 45 [2019-12-07 17:14:42,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:42,146 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-12-07 17:14:42,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 17:14:42,146 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-12-07 17:14:42,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 17:14:42,146 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:42,146 INFO L410 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] [2019-12-07 17:14:42,147 INFO L410 AbstractCegarLoop]: === Iteration 15 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:14:42,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:42,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1875216262, now seen corresponding path program 1 times [2019-12-07 17:14:42,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:42,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884405728] [2019-12-07 17:14:42,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:42,263 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:14:42,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884405728] [2019-12-07 17:14:42,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:42,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 17:14:42,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686269716] [2019-12-07 17:14:42,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 17:14:42,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:42,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 17:14:42,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:14:42,264 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 14 states. [2019-12-07 17:14:42,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:42,739 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2019-12-07 17:14:42,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:14:42,740 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2019-12-07 17:14:42,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:42,740 INFO L225 Difference]: With dead ends: 131 [2019-12-07 17:14:42,740 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 17:14:42,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-12-07 17:14:42,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 17:14:42,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 113. [2019-12-07 17:14:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 17:14:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2019-12-07 17:14:42,744 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 47 [2019-12-07 17:14:42,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:42,744 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2019-12-07 17:14:42,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 17:14:42,744 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2019-12-07 17:14:42,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 17:14:42,744 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:42,744 INFO L410 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] [2019-12-07 17:14:42,745 INFO L410 AbstractCegarLoop]: === Iteration 16 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:14:42,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:42,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1875216263, now seen corresponding path program 1 times [2019-12-07 17:14:42,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:42,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860615198] [2019-12-07 17:14:42,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:42,801 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 17:14:42,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860615198] [2019-12-07 17:14:42,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:42,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:14:42,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569279943] [2019-12-07 17:14:42,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:14:42,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:42,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:14:42,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:14:42,802 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 6 states. [2019-12-07 17:14:42,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:42,968 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2019-12-07 17:14:42,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:14:42,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-07 17:14:42,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:42,969 INFO L225 Difference]: With dead ends: 137 [2019-12-07 17:14:42,969 INFO L226 Difference]: Without dead ends: 137 [2019-12-07 17:14:42,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:14:42,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-12-07 17:14:42,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 115. [2019-12-07 17:14:42,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-12-07 17:14:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2019-12-07 17:14:42,972 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 47 [2019-12-07 17:14:42,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:42,972 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2019-12-07 17:14:42,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:14:42,973 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2019-12-07 17:14:42,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 17:14:42,973 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:42,973 INFO L410 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] [2019-12-07 17:14:42,973 INFO L410 AbstractCegarLoop]: === Iteration 17 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:14:42,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:42,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1582303812, now seen corresponding path program 1 times [2019-12-07 17:14:42,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:42,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730123689] [2019-12-07 17:14:42,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:43,035 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-07 17:14:43,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730123689] [2019-12-07 17:14:43,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:43,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:14:43,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864789706] [2019-12-07 17:14:43,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:14:43,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:43,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:14:43,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:14:43,036 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand 8 states. [2019-12-07 17:14:43,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:43,518 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2019-12-07 17:14:43,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:14:43,519 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-12-07 17:14:43,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:43,522 INFO L225 Difference]: With dead ends: 117 [2019-12-07 17:14:43,522 INFO L226 Difference]: Without dead ends: 117 [2019-12-07 17:14:43,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:14:43,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-12-07 17:14:43,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2019-12-07 17:14:43,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-12-07 17:14:43,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2019-12-07 17:14:43,532 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 47 [2019-12-07 17:14:43,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:43,533 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2019-12-07 17:14:43,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:14:43,533 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2019-12-07 17:14:43,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 17:14:43,535 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:43,535 INFO L410 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] [2019-12-07 17:14:43,536 INFO L410 AbstractCegarLoop]: === Iteration 18 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:14:43,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:43,537 INFO L82 PathProgramCache]: Analyzing trace with hash 923693868, now seen corresponding path program 1 times [2019-12-07 17:14:43,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:43,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948122691] [2019-12-07 17:14:43,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:43,605 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 17:14:43,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948122691] [2019-12-07 17:14:43,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:43,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:14:43,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844168949] [2019-12-07 17:14:43,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:14:43,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:43,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:14:43,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:14:43,606 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand 7 states. [2019-12-07 17:14:43,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:43,837 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2019-12-07 17:14:43,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:14:43,838 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-07 17:14:43,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:43,839 INFO L225 Difference]: With dead ends: 130 [2019-12-07 17:14:43,839 INFO L226 Difference]: Without dead ends: 130 [2019-12-07 17:14:43,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:14:43,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-07 17:14:43,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 109. [2019-12-07 17:14:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 17:14:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2019-12-07 17:14:43,842 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 48 [2019-12-07 17:14:43,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:43,843 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2019-12-07 17:14:43,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:14:43,843 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2019-12-07 17:14:43,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 17:14:43,843 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:43,843 INFO L410 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] [2019-12-07 17:14:43,843 INFO L410 AbstractCegarLoop]: === Iteration 19 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:14:43,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:43,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1220218256, now seen corresponding path program 1 times [2019-12-07 17:14:43,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:43,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402222977] [2019-12-07 17:14:43,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:43,983 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 17:14:43,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402222977] [2019-12-07 17:14:43,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:43,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 17:14:43,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418940903] [2019-12-07 17:14:43,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 17:14:43,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:43,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 17:14:43,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:14:43,984 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand 15 states. [2019-12-07 17:14:44,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:44,476 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2019-12-07 17:14:44,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 17:14:44,476 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-07 17:14:44,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:44,477 INFO L225 Difference]: With dead ends: 131 [2019-12-07 17:14:44,477 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 17:14:44,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-12-07 17:14:44,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 17:14:44,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 112. [2019-12-07 17:14:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 17:14:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2019-12-07 17:14:44,480 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 55 [2019-12-07 17:14:44,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:44,480 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2019-12-07 17:14:44,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 17:14:44,480 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2019-12-07 17:14:44,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 17:14:44,481 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:44,481 INFO L410 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] [2019-12-07 17:14:44,481 INFO L410 AbstractCegarLoop]: === Iteration 20 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:14:44,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:44,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1220218255, now seen corresponding path program 1 times [2019-12-07 17:14:44,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:44,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840650143] [2019-12-07 17:14:44,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:44,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 17:14:44,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840650143] [2019-12-07 17:14:44,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:44,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 17:14:44,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383535470] [2019-12-07 17:14:44,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 17:14:44,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:44,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:14:44,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:14:44,677 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand 16 states. [2019-12-07 17:14:45,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:45,859 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2019-12-07 17:14:45,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 17:14:45,860 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-12-07 17:14:45,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:45,860 INFO L225 Difference]: With dead ends: 130 [2019-12-07 17:14:45,860 INFO L226 Difference]: Without dead ends: 130 [2019-12-07 17:14:45,861 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2019-12-07 17:14:45,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-07 17:14:45,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112. [2019-12-07 17:14:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 17:14:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2019-12-07 17:14:45,863 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 55 [2019-12-07 17:14:45,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:45,863 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2019-12-07 17:14:45,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 17:14:45,864 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2019-12-07 17:14:45,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:14:45,864 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:45,864 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:14:45,864 INFO L410 AbstractCegarLoop]: === Iteration 21 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:14:45,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:45,864 INFO L82 PathProgramCache]: Analyzing trace with hash -598233064, now seen corresponding path program 1 times [2019-12-07 17:14:45,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:45,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476565167] [2019-12-07 17:14:45,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:46,379 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:14:46,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476565167] [2019-12-07 17:14:46,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897071593] [2019-12-07 17:14:46,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:14:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:46,456 INFO L264 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 68 conjunts are in the unsatisfiable core [2019-12-07 17:14:46,458 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:46,541 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:14:46,541 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 17:14:46,542 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:14:46,546 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:14:46,546 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:14:46,546 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 17:14:46,596 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 17:14:46,596 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:14:46,600 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:14:46,600 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:14:46,600 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 17:14:46,635 INFO L377 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 21 treesize of output 20 [2019-12-07 17:14:46,635 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:14:46,639 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:14:46,640 INFO L534 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. [2019-12-07 17:14:46,640 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-12-07 17:14:46,723 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:14:46,723 INFO L377 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 1 case distinctions, treesize of input 28 treesize of output 52 [2019-12-07 17:14:46,724 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:14:46,739 INFO L614 ElimStorePlain]: treesize reduction 22, result has 60.0 percent of original size [2019-12-07 17:14:46,740 INFO L534 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. [2019-12-07 17:14:46,740 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-12-07 17:14:46,827 INFO L343 Elim1Store]: treesize reduction 34, result has 60.0 percent of original size [2019-12-07 17:14:46,827 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 75 [2019-12-07 17:14:46,828 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:14:46,843 INFO L614 ElimStorePlain]: treesize reduction 50, result has 46.8 percent of original size [2019-12-07 17:14:46,843 INFO L534 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. [2019-12-07 17:14:46,844 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2019-12-07 17:14:47,067 INFO L343 Elim1Store]: treesize reduction 10, result has 75.6 percent of original size [2019-12-07 17:14:47,067 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 49 [2019-12-07 17:14:47,068 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:14:47,072 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:14:47,073 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:14:47,073 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:9 [2019-12-07 17:15:02,029 WARN L192 SmtUtils]: Spent 810.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-12-07 17:15:02,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:15:02,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:15:02,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:15:02,085 INFO L343 Elim1Store]: treesize reduction 28, result has 65.0 percent of original size [2019-12-07 17:15:02,085 INFO L377 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 86 [2019-12-07 17:15:02,086 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:02,105 INFO L614 ElimStorePlain]: treesize reduction 18, result has 76.3 percent of original size [2019-12-07 17:15:02,105 INFO L534 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. [2019-12-07 17:15:02,105 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:55 [2019-12-07 17:15:02,309 INFO L343 Elim1Store]: treesize reduction 10, result has 75.6 percent of original size [2019-12-07 17:15:02,309 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 52 [2019-12-07 17:15:02,309 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:02,312 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:02,312 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:15:02,312 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:5 [2019-12-07 17:15:02,322 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 17:15:02,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:15:02,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 46 [2019-12-07 17:15:02,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381072113] [2019-12-07 17:15:02,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-12-07 17:15:02,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:15:02,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-12-07 17:15:02,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=2025, Unknown=19, NotChecked=0, Total=2162 [2019-12-07 17:15:02,324 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand 47 states. [2019-12-07 17:15:21,239 WARN L192 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-12-07 17:15:28,314 WARN L192 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-12-07 17:15:32,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:15:32,119 INFO L93 Difference]: Finished difference Result 176 states and 194 transitions. [2019-12-07 17:15:32,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 17:15:32,119 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 56 [2019-12-07 17:15:32,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:15:32,120 INFO L225 Difference]: With dead ends: 176 [2019-12-07 17:15:32,120 INFO L226 Difference]: Without dead ends: 176 [2019-12-07 17:15:32,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=388, Invalid=4563, Unknown=19, NotChecked=0, Total=4970 [2019-12-07 17:15:32,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-12-07 17:15:32,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 127. [2019-12-07 17:15:32,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-12-07 17:15:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 144 transitions. [2019-12-07 17:15:32,125 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 144 transitions. Word has length 56 [2019-12-07 17:15:32,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:15:32,125 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 144 transitions. [2019-12-07 17:15:32,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-12-07 17:15:32,125 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2019-12-07 17:15:32,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:15:32,125 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:15:32,125 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:15:32,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:15:32,327 INFO L410 AbstractCegarLoop]: === Iteration 22 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:15:32,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:15:32,327 INFO L82 PathProgramCache]: Analyzing trace with hash -598233063, now seen corresponding path program 1 times [2019-12-07 17:15:32,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:15:32,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213508175] [2019-12-07 17:15:32,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:15:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:33,142 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:15:33,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213508175] [2019-12-07 17:15:33,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35178196] [2019-12-07 17:15:33,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:15:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:33,223 INFO L264 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 93 conjunts are in the unsatisfiable core [2019-12-07 17:15:33,226 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:15:33,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:15:33,534 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-12-07 17:15:33,534 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:33,542 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:33,547 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:33,548 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 17:15:33,548 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:33,555 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:33,555 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:15:33,555 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2019-12-07 17:15:33,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 17:15:33,651 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:33,663 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:33,666 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 17:15:33,666 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:33,676 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:33,676 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:15:33,676 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-12-07 17:15:33,737 INFO L377 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 25 treesize of output 24 [2019-12-07 17:15:33,738 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:33,763 INFO L614 ElimStorePlain]: treesize reduction 9, result has 88.9 percent of original size [2019-12-07 17:15:33,765 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2019-12-07 17:15:33,766 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:33,777 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:33,777 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:15:33,777 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:68 [2019-12-07 17:15:33,922 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:33,922 INFO L377 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 1 case distinctions, treesize of input 32 treesize of output 68 [2019-12-07 17:15:33,922 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:33,959 INFO L614 ElimStorePlain]: treesize reduction 34, result has 71.7 percent of original size [2019-12-07 17:15:33,968 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:33,968 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 68 [2019-12-07 17:15:33,968 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:34,000 INFO L614 ElimStorePlain]: treesize reduction 34, result has 70.7 percent of original size [2019-12-07 17:15:34,001 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:15:34,001 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:82 [2019-12-07 17:15:34,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:15:34,121 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:34,122 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 199 [2019-12-07 17:15:34,122 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:34,168 INFO L614 ElimStorePlain]: treesize reduction 106, result has 54.1 percent of original size [2019-12-07 17:15:34,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:15:34,174 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:34,174 INFO L377 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 88 [2019-12-07 17:15:34,175 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:34,191 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:34,191 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:15:34,191 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:129, output treesize:124 [2019-12-07 17:15:34,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:15:34,604 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:34,604 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 150 [2019-12-07 17:15:34,606 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:15:34,618 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:34,626 INFO L343 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2019-12-07 17:15:34,626 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 36 [2019-12-07 17:15:34,627 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:34,632 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:34,633 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:15:34,633 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:130, output treesize:21 [2019-12-07 17:15:53,611 WARN L192 SmtUtils]: Spent 1.49 s on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 17:15:53,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:15:53,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:15:53,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:15:53,739 INFO L343 Elim1Store]: treesize reduction 72, result has 68.3 percent of original size [2019-12-07 17:15:53,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 124 treesize of output 224 [2019-12-07 17:15:53,740 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:53,807 INFO L614 ElimStorePlain]: treesize reduction 44, result has 79.6 percent of original size [2019-12-07 17:15:53,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:15:53,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:15:53,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:15:53,815 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:53,815 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 112 [2019-12-07 17:15:53,816 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:53,863 INFO L614 ElimStorePlain]: treesize reduction 36, result has 81.0 percent of original size [2019-12-07 17:15:53,864 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:15:53,864 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:179, output treesize:150 [2019-12-07 17:15:54,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:15:54,198 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:54,198 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 112 treesize of output 153 [2019-12-07 17:15:54,199 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:54,210 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:54,218 INFO L343 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2019-12-07 17:15:54,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 39 [2019-12-07 17:15:54,218 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:54,225 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:54,226 INFO L534 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. [2019-12-07 17:15:54,226 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:138, output treesize:23 [2019-12-07 17:15:54,389 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 17:15:54,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:15:54,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 54 [2019-12-07 17:15:54,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396053128] [2019-12-07 17:15:54,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-12-07 17:15:54,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:15:54,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-12-07 17:15:54,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2819, Unknown=11, NotChecked=0, Total=2970 [2019-12-07 17:15:54,391 INFO L87 Difference]: Start difference. First operand 127 states and 144 transitions. Second operand 55 states. [2019-12-07 17:15:56,222 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 87 [2019-12-07 17:15:56,768 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-12-07 17:16:00,779 WARN L192 SmtUtils]: Spent 3.81 s on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2019-12-07 17:16:01,245 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 104 [2019-12-07 17:16:08,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:08,975 INFO L93 Difference]: Finished difference Result 262 states and 289 transitions. [2019-12-07 17:16:08,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 17:16:08,975 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 56 [2019-12-07 17:16:08,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:08,977 INFO L225 Difference]: With dead ends: 262 [2019-12-07 17:16:08,977 INFO L226 Difference]: Without dead ends: 262 [2019-12-07 17:16:08,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1320 ImplicationChecksByTransitivity, 29.1s TimeCoverageRelationStatistics Valid=504, Invalid=6964, Unknown=14, NotChecked=0, Total=7482 [2019-12-07 17:16:08,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-12-07 17:16:08,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 141. [2019-12-07 17:16:08,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 17:16:08,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 162 transitions. [2019-12-07 17:16:08,984 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 162 transitions. Word has length 56 [2019-12-07 17:16:08,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:08,984 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 162 transitions. [2019-12-07 17:16:08,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-12-07 17:16:08,984 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 162 transitions. [2019-12-07 17:16:08,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 17:16:08,984 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:08,984 INFO L410 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] [2019-12-07 17:16:09,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:16:09,185 INFO L410 AbstractCegarLoop]: === Iteration 23 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:16:09,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:09,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1082815828, now seen corresponding path program 1 times [2019-12-07 17:16:09,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:09,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443587755] [2019-12-07 17:16:09,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:09,252 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 17:16:09,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443587755] [2019-12-07 17:16:09,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:09,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:16:09,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969127757] [2019-12-07 17:16:09,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:16:09,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:09,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:16:09,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:16:09,253 INFO L87 Difference]: Start difference. First operand 141 states and 162 transitions. Second operand 8 states. [2019-12-07 17:16:09,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:09,478 INFO L93 Difference]: Finished difference Result 168 states and 187 transitions. [2019-12-07 17:16:09,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:16:09,479 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-12-07 17:16:09,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:09,479 INFO L225 Difference]: With dead ends: 168 [2019-12-07 17:16:09,480 INFO L226 Difference]: Without dead ends: 168 [2019-12-07 17:16:09,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:16:09,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-12-07 17:16:09,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 148. [2019-12-07 17:16:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-12-07 17:16:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 169 transitions. [2019-12-07 17:16:09,483 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 169 transitions. Word has length 58 [2019-12-07 17:16:09,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:09,483 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 169 transitions. [2019-12-07 17:16:09,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:16:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 169 transitions. [2019-12-07 17:16:09,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 17:16:09,484 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:09,484 INFO L410 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] [2019-12-07 17:16:09,484 INFO L410 AbstractCegarLoop]: === Iteration 24 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:16:09,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:09,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2140239344, now seen corresponding path program 2 times [2019-12-07 17:16:09,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:09,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750080258] [2019-12-07 17:16:09,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:09,562 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 17:16:09,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750080258] [2019-12-07 17:16:09,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397862448] [2019-12-07 17:16:09,562 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:16:09,691 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:16:09,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:16:09,692 INFO L264 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 17:16:09,694 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:16:09,699 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 17:16:09,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:16:09,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 10 [2019-12-07 17:16:09,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653978759] [2019-12-07 17:16:09,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:16:09,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:09,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:16:09,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:16:09,700 INFO L87 Difference]: Start difference. First operand 148 states and 169 transitions. Second operand 10 states. [2019-12-07 17:16:10,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:10,017 INFO L93 Difference]: Finished difference Result 143 states and 153 transitions. [2019-12-07 17:16:10,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:16:10,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-07 17:16:10,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:10,018 INFO L225 Difference]: With dead ends: 143 [2019-12-07 17:16:10,018 INFO L226 Difference]: Without dead ends: 143 [2019-12-07 17:16:10,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2019-12-07 17:16:10,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-12-07 17:16:10,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 129. [2019-12-07 17:16:10,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-12-07 17:16:10,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2019-12-07 17:16:10,021 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 141 transitions. Word has length 59 [2019-12-07 17:16:10,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:10,021 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 141 transitions. [2019-12-07 17:16:10,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:16:10,022 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 141 transitions. [2019-12-07 17:16:10,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 17:16:10,022 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:10,022 INFO L410 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, 1, 1, 1] [2019-12-07 17:16:10,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:16:10,223 INFO L410 AbstractCegarLoop]: === Iteration 25 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:16:10,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:10,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1611069169, now seen corresponding path program 1 times [2019-12-07 17:16:10,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:10,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297488181] [2019-12-07 17:16:10,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:10,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 17:16:10,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297488181] [2019-12-07 17:16:10,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019429755] [2019-12-07 17:16:10,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:16:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:10,377 INFO L264 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:16:10,378 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:16:10,402 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 17:16:10,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:16:10,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-12-07 17:16:10,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679115751] [2019-12-07 17:16:10,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:16:10,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:10,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:16:10,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:16:10,404 INFO L87 Difference]: Start difference. First operand 129 states and 141 transitions. Second operand 10 states. [2019-12-07 17:16:10,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:10,625 INFO L93 Difference]: Finished difference Result 160 states and 173 transitions. [2019-12-07 17:16:10,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:16:10,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2019-12-07 17:16:10,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:10,626 INFO L225 Difference]: With dead ends: 160 [2019-12-07 17:16:10,626 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 17:16:10,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:16:10,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 17:16:10,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 135. [2019-12-07 17:16:10,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-12-07 17:16:10,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 148 transitions. [2019-12-07 17:16:10,629 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 148 transitions. Word has length 61 [2019-12-07 17:16:10,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:10,629 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 148 transitions. [2019-12-07 17:16:10,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:16:10,629 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 148 transitions. [2019-12-07 17:16:10,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:16:10,630 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:10,630 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-12-07 17:16:10,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:16:10,831 INFO L410 AbstractCegarLoop]: === Iteration 26 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:16:10,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:10,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1271618820, now seen corresponding path program 3 times [2019-12-07 17:16:10,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:10,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720990040] [2019-12-07 17:16:10,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:10,958 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 17:16:10,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720990040] [2019-12-07 17:16:10,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505746234] [2019-12-07 17:16:10,958 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:16:11,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 17:16:11,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:16:11,196 INFO L264 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 17:16:11,197 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:16:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 17:16:11,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:16:11,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-12-07 17:16:11,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75621572] [2019-12-07 17:16:11,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 17:16:11,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:11,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 17:16:11,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-12-07 17:16:11,249 INFO L87 Difference]: Start difference. First operand 135 states and 148 transitions. Second operand 17 states. [2019-12-07 17:16:11,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:11,688 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2019-12-07 17:16:11,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:16:11,688 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-07 17:16:11,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:11,689 INFO L225 Difference]: With dead ends: 139 [2019-12-07 17:16:11,689 INFO L226 Difference]: Without dead ends: 139 [2019-12-07 17:16:11,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-12-07 17:16:11,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-12-07 17:16:11,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 124. [2019-12-07 17:16:11,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-12-07 17:16:11,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2019-12-07 17:16:11,692 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 67 [2019-12-07 17:16:11,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:11,692 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2019-12-07 17:16:11,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 17:16:11,692 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2019-12-07 17:16:11,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 17:16:11,693 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:11,693 INFO L410 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] [2019-12-07 17:16:11,893 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:16:11,894 INFO L410 AbstractCegarLoop]: === Iteration 27 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:16:11,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:11,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1927997051, now seen corresponding path program 2 times [2019-12-07 17:16:11,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:11,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685456912] [2019-12-07 17:16:11,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:12,102 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 17:16:12,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685456912] [2019-12-07 17:16:12,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462698207] [2019-12-07 17:16:12,103 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:16:12,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:16:12,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:16:12,218 INFO L264 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:16:12,219 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:16:12,246 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 17:16:12,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:16:12,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2019-12-07 17:16:12,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941554175] [2019-12-07 17:16:12,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:16:12,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:12,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:16:12,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:16:12,247 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 6 states. [2019-12-07 17:16:12,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:12,284 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2019-12-07 17:16:12,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:16:12,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-07 17:16:12,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:12,285 INFO L225 Difference]: With dead ends: 124 [2019-12-07 17:16:12,285 INFO L226 Difference]: Without dead ends: 121 [2019-12-07 17:16:12,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:16:12,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-12-07 17:16:12,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2019-12-07 17:16:12,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-12-07 17:16:12,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2019-12-07 17:16:12,288 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 69 [2019-12-07 17:16:12,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:12,289 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2019-12-07 17:16:12,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:16:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2019-12-07 17:16:12,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 17:16:12,289 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:12,289 INFO L410 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, 1, 1, 1] [2019-12-07 17:16:12,490 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:16:12,490 INFO L410 AbstractCegarLoop]: === Iteration 28 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:16:12,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:12,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1954401651, now seen corresponding path program 1 times [2019-12-07 17:16:12,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:12,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229571473] [2019-12-07 17:16:12,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:13,658 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 17:16:13,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229571473] [2019-12-07 17:16:13,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003033922] [2019-12-07 17:16:13,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:16:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:13,747 INFO L264 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 100 conjunts are in the unsatisfiable core [2019-12-07 17:16:13,749 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:16:14,018 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:14,018 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 17:16:14,019 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:14,021 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:14,021 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:14,022 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 17:16:14,097 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 17:16:14,097 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:14,100 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:14,100 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:14,101 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 17:16:14,146 INFO L377 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 21 treesize of output 20 [2019-12-07 17:16:14,146 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:14,152 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:14,152 INFO L534 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. [2019-12-07 17:16:14,152 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-12-07 17:16:14,268 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:14,268 INFO L377 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 1 case distinctions, treesize of input 28 treesize of output 52 [2019-12-07 17:16:14,269 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:14,282 INFO L614 ElimStorePlain]: treesize reduction 22, result has 56.0 percent of original size [2019-12-07 17:16:14,282 INFO L534 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. [2019-12-07 17:16:14,283 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-12-07 17:16:14,370 INFO L343 Elim1Store]: treesize reduction 34, result has 60.0 percent of original size [2019-12-07 17:16:14,370 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 70 [2019-12-07 17:16:14,370 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:14,382 INFO L614 ElimStorePlain]: treesize reduction 50, result has 41.2 percent of original size [2019-12-07 17:16:14,382 INFO L534 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. [2019-12-07 17:16:14,383 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2019-12-07 17:16:15,544 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 17:16:15,545 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:15,562 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:15,562 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:15,563 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-12-07 17:16:15,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:16:15,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:16:15,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:16:15,868 INFO L343 Elim1Store]: treesize reduction 28, result has 65.0 percent of original size [2019-12-07 17:16:15,868 INFO L377 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 81 [2019-12-07 17:16:15,869 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:15,886 INFO L614 ElimStorePlain]: treesize reduction 42, result has 52.8 percent of original size [2019-12-07 17:16:15,886 INFO L534 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. [2019-12-07 17:16:15,886 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:47 [2019-12-07 17:16:16,764 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~data Int) (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_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) (+ dll_circular_update_at_~head.offset 8) dll_circular_update_at_~data))) |c_#memory_int|)) is different from true [2019-12-07 17:16:16,767 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_int_BEFORE_CALL_2|], 6=[|v_#memory_$Pointer$.base_BEFORE_CALL_10|]} [2019-12-07 17:16:16,770 INFO L377 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 31 treesize of output 26 [2019-12-07 17:16:16,770 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:16,778 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:16,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:16:16,789 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:16,789 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 53 [2019-12-07 17:16:16,789 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:16:16,795 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:16,795 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:16,795 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:68, output treesize:13 [2019-12-07 17:16:17,855 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:17,856 INFO L377 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 37 treesize of output 29 [2019-12-07 17:16:17,856 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:17,864 INFO L614 ElimStorePlain]: treesize reduction 16, result has 30.4 percent of original size [2019-12-07 17:16:17,864 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:17,864 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:7 [2019-12-07 17:16:17,930 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-12-07 17:16:17,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:16:17,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 37] total 74 [2019-12-07 17:16:17,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209972344] [2019-12-07 17:16:17,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-12-07 17:16:17,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:17,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-12-07 17:16:17,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=5041, Unknown=2, NotChecked=142, Total=5402 [2019-12-07 17:16:17,932 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 74 states. [2019-12-07 17:16:25,694 WARN L192 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2019-12-07 17:16:30,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:30,079 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2019-12-07 17:16:30,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 17:16:30,079 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 72 [2019-12-07 17:16:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:30,080 INFO L225 Difference]: With dead ends: 137 [2019-12-07 17:16:30,080 INFO L226 Difference]: Without dead ends: 137 [2019-12-07 17:16:30,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 107 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2316 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=582, Invalid=10967, Unknown=11, NotChecked=212, Total=11772 [2019-12-07 17:16:30,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-12-07 17:16:30,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 119. [2019-12-07 17:16:30,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-12-07 17:16:30,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2019-12-07 17:16:30,087 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 72 [2019-12-07 17:16:30,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:30,087 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2019-12-07 17:16:30,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-12-07 17:16:30,088 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2019-12-07 17:16:30,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 17:16:30,088 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:30,088 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:16:30,289 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:16:30,290 INFO L410 AbstractCegarLoop]: === Iteration 29 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:16:30,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:30,291 INFO L82 PathProgramCache]: Analyzing trace with hash 799783174, now seen corresponding path program 1 times [2019-12-07 17:16:30,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:30,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054807062] [2019-12-07 17:16:30,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:31,008 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 17:16:31,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054807062] [2019-12-07 17:16:31,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539729821] [2019-12-07 17:16:31,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:16:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:31,088 INFO L264 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 81 conjunts are in the unsatisfiable core [2019-12-07 17:16:31,090 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:16:31,179 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:31,179 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 17:16:31,179 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:31,182 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:31,182 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:31,182 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 17:16:31,236 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 17:16:31,236 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:31,239 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:31,239 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:31,239 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 17:16:31,273 INFO L377 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 21 treesize of output 20 [2019-12-07 17:16:31,274 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:31,278 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:31,278 INFO L534 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. [2019-12-07 17:16:31,279 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-12-07 17:16:31,368 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:31,368 INFO L377 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 1 case distinctions, treesize of input 28 treesize of output 52 [2019-12-07 17:16:31,368 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:31,381 INFO L614 ElimStorePlain]: treesize reduction 22, result has 56.0 percent of original size [2019-12-07 17:16:31,381 INFO L534 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. [2019-12-07 17:16:31,381 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-12-07 17:16:31,467 INFO L343 Elim1Store]: treesize reduction 34, result has 60.0 percent of original size [2019-12-07 17:16:31,467 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 70 [2019-12-07 17:16:31,467 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:31,481 INFO L614 ElimStorePlain]: treesize reduction 58, result has 40.2 percent of original size [2019-12-07 17:16:31,481 INFO L534 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. [2019-12-07 17:16:31,481 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:39 [2019-12-07 17:16:32,500 WARN L860 $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 [2019-12-07 17:16:32,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:16:32,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:16:32,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:16:32,535 INFO L343 Elim1Store]: treesize reduction 28, result has 65.0 percent of original size [2019-12-07 17:16:32,535 INFO L377 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 81 [2019-12-07 17:16:32,536 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:32,549 INFO L614 ElimStorePlain]: treesize reduction 42, result has 50.0 percent of original size [2019-12-07 17:16:32,550 INFO L534 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. [2019-12-07 17:16:32,550 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:61, output treesize:39 [2019-12-07 17:16:33,457 WARN L192 SmtUtils]: Spent 807.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-12-07 17:16:33,561 INFO L343 Elim1Store]: treesize reduction 10, result has 94.4 percent of original size [2019-12-07 17:16:33,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 206 [2019-12-07 17:16:33,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:33,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:33,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:33,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:33,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:33,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:33,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:33,565 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 17:16:33,621 INFO L614 ElimStorePlain]: treesize reduction 492, result has 20.3 percent of original size [2019-12-07 17:16:33,622 INFO L534 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. [2019-12-07 17:16:33,622 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:79, output treesize:106 [2019-12-07 17:16:34,043 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-12-07 17:16:34,043 INFO L377 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 42 treesize of output 16 [2019-12-07 17:16:34,043 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:34,046 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:34,046 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:34,046 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:5 [2019-12-07 17:16:34,064 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 2 not checked. [2019-12-07 17:16:34,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:16:34,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 53 [2019-12-07 17:16:34,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599830323] [2019-12-07 17:16:34,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-12-07 17:16:34,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:34,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-12-07 17:16:34,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2615, Unknown=1, NotChecked=102, Total=2862 [2019-12-07 17:16:34,065 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 54 states. [2019-12-07 17:16:38,716 WARN L192 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2019-12-07 17:16:39,227 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-12-07 17:16:40,300 WARN L192 SmtUtils]: Spent 822.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-12-07 17:16:41,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:41,574 INFO L93 Difference]: Finished difference Result 145 states and 151 transitions. [2019-12-07 17:16:41,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 17:16:41,574 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 80 [2019-12-07 17:16:41,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:41,575 INFO L225 Difference]: With dead ends: 145 [2019-12-07 17:16:41,575 INFO L226 Difference]: Without dead ends: 145 [2019-12-07 17:16:41,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=432, Invalid=5577, Unknown=1, NotChecked=152, Total=6162 [2019-12-07 17:16:41,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-12-07 17:16:41,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 123. [2019-12-07 17:16:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-12-07 17:16:41,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2019-12-07 17:16:41,579 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 80 [2019-12-07 17:16:41,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:41,579 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2019-12-07 17:16:41,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-12-07 17:16:41,580 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2019-12-07 17:16:41,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 17:16:41,580 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:41,580 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:16:41,781 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:16:41,782 INFO L410 AbstractCegarLoop]: === Iteration 30 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:16:41,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:41,782 INFO L82 PathProgramCache]: Analyzing trace with hash 799783175, now seen corresponding path program 1 times [2019-12-07 17:16:41,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:41,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663480611] [2019-12-07 17:16:41,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 17:16:43,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663480611] [2019-12-07 17:16:43,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341473029] [2019-12-07 17:16:43,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:16:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:43,588 INFO L264 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 92 conjunts are in the unsatisfiable core [2019-12-07 17:16:43,589 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:16:43,807 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:43,807 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 17:16:43,807 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:43,810 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:43,810 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:43,810 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 17:16:43,878 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 17:16:43,879 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:43,882 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:43,882 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:43,882 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 17:16:43,923 INFO L377 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 21 treesize of output 20 [2019-12-07 17:16:43,924 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:43,928 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:43,928 INFO L534 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. [2019-12-07 17:16:43,928 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-12-07 17:16:44,036 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:44,036 INFO L377 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 1 case distinctions, treesize of input 28 treesize of output 52 [2019-12-07 17:16:44,036 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:44,049 INFO L614 ElimStorePlain]: treesize reduction 22, result has 56.0 percent of original size [2019-12-07 17:16:44,050 INFO L534 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. [2019-12-07 17:16:44,050 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-12-07 17:16:44,144 INFO L343 Elim1Store]: treesize reduction 34, result has 60.0 percent of original size [2019-12-07 17:16:44,144 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 70 [2019-12-07 17:16:44,144 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:44,156 INFO L614 ElimStorePlain]: treesize reduction 50, result has 41.2 percent of original size [2019-12-07 17:16:44,156 INFO L534 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. [2019-12-07 17:16:44,156 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2019-12-07 17:16:45,251 WARN L860 $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 [2019-12-07 17:16:45,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:16:45,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:16:45,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:16:45,286 INFO L343 Elim1Store]: treesize reduction 28, result has 65.0 percent of original size [2019-12-07 17:16:45,286 INFO L377 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 81 [2019-12-07 17:16:45,286 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:45,299 INFO L614 ElimStorePlain]: treesize reduction 42, result has 47.5 percent of original size [2019-12-07 17:16:45,299 INFO L534 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. [2019-12-07 17:16:45,299 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:35 [2019-12-07 17:16:45,541 INFO L430 ElimStorePlain]: Different costs {2=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_51|], 12=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_51|]} [2019-12-07 17:16:45,543 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 81 [2019-12-07 17:16:45,544 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:45,555 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:45,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:16:45,608 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:45,608 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 245 [2019-12-07 17:16:45,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:16:45,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:16:45,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:16:45,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:16:45,625 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 15 xjuncts. [2019-12-07 17:16:45,803 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2019-12-07 17:16:45,803 INFO L614 ElimStorePlain]: treesize reduction 3835, result has 4.0 percent of original size [2019-12-07 17:16:45,803 INFO L534 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. [2019-12-07 17:16:45,804 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:137, output treesize:148 [2019-12-07 17:16:46,092 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 25 [2019-12-07 17:16:48,518 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2019-12-07 17:16:48,522 INFO L377 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 34 treesize of output 22 [2019-12-07 17:16:48,523 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:48,530 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:48,532 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-12-07 17:16:48,532 INFO L377 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 44 treesize of output 18 [2019-12-07 17:16:48,533 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:48,536 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:48,536 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:48,537 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:13 [2019-12-07 17:16:48,660 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2019-12-07 17:16:48,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:16:48,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31] total 62 [2019-12-07 17:16:48,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317708520] [2019-12-07 17:16:48,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-12-07 17:16:48,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:48,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-12-07 17:16:48,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3595, Unknown=2, NotChecked=120, Total=3906 [2019-12-07 17:16:48,662 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 63 states. [2019-12-07 17:17:07,078 WARN L192 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-12-07 17:17:10,043 WARN L192 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-12-07 17:17:14,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:14,891 INFO L93 Difference]: Finished difference Result 144 states and 151 transitions. [2019-12-07 17:17:14,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 17:17:14,891 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 80 [2019-12-07 17:17:14,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:14,892 INFO L225 Difference]: With dead ends: 144 [2019-12-07 17:17:14,892 INFO L226 Difference]: Without dead ends: 144 [2019-12-07 17:17:14,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=547, Invalid=7285, Unknown=4, NotChecked=174, Total=8010 [2019-12-07 17:17:14,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-12-07 17:17:14,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 122. [2019-12-07 17:17:14,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-12-07 17:17:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2019-12-07 17:17:14,897 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 80 [2019-12-07 17:17:14,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:14,898 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2019-12-07 17:17:14,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-12-07 17:17:14,898 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2019-12-07 17:17:14,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 17:17:14,898 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:14,898 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:15,099 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:17:15,100 INFO L410 AbstractCegarLoop]: === Iteration 31 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:17:15,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:15,101 INFO L82 PathProgramCache]: Analyzing trace with hash 806075903, now seen corresponding path program 1 times [2019-12-07 17:17:15,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:15,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891461256] [2019-12-07 17:17:15,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:15,177 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 17:17:15,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891461256] [2019-12-07 17:17:15,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731551037] [2019-12-07 17:17:15,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:17:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:15,252 INFO L264 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:17:15,253 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:17:15,272 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 17:17:15,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:17:15,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2019-12-07 17:17:15,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671027123] [2019-12-07 17:17:15,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:17:15,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:15,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:17:15,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:17:15,273 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 6 states. [2019-12-07 17:17:15,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:15,307 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2019-12-07 17:17:15,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:17:15,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-07 17:17:15,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:15,307 INFO L225 Difference]: With dead ends: 126 [2019-12-07 17:17:15,308 INFO L226 Difference]: Without dead ends: 122 [2019-12-07 17:17:15,308 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:17:15,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-12-07 17:17:15,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-12-07 17:17:15,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-12-07 17:17:15,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2019-12-07 17:17:15,310 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 83 [2019-12-07 17:17:15,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:15,310 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2019-12-07 17:17:15,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:17:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2019-12-07 17:17:15,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 17:17:15,311 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:15,311 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:15,511 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:17:15,512 INFO L410 AbstractCegarLoop]: === Iteration 32 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:17:15,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:15,513 INFO L82 PathProgramCache]: Analyzing trace with hash -2136334594, now seen corresponding path program 2 times [2019-12-07 17:17:15,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:15,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941859230] [2019-12-07 17:17:15,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:15,599 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 17:17:15,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941859230] [2019-12-07 17:17:15,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244161591] [2019-12-07 17:17:15,600 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:17:15,723 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:17:15,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:17:15,724 INFO L264 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 17:17:15,726 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:17:15,731 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 17:17:15,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:17:15,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 10 [2019-12-07 17:17:15,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052290493] [2019-12-07 17:17:15,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:17:15,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:15,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:17:15,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:17:15,732 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 10 states. [2019-12-07 17:17:15,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:15,988 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2019-12-07 17:17:15,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:17:15,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2019-12-07 17:17:15,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:15,989 INFO L225 Difference]: With dead ends: 127 [2019-12-07 17:17:15,989 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 17:17:15,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:17:15,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 17:17:15,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 113. [2019-12-07 17:17:15,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 17:17:15,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2019-12-07 17:17:15,992 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 83 [2019-12-07 17:17:15,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:15,993 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2019-12-07 17:17:15,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:17:15,993 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2019-12-07 17:17:15,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 17:17:15,993 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:15,994 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:16,194 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:17:16,195 INFO L410 AbstractCegarLoop]: === Iteration 33 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:17:16,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:16,196 INFO L82 PathProgramCache]: Analyzing trace with hash -2069367545, now seen corresponding path program 1 times [2019-12-07 17:17:16,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:16,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736948435] [2019-12-07 17:17:16,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:17:17,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736948435] [2019-12-07 17:17:17,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060288103] [2019-12-07 17:17:17,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:17:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:17,888 INFO L264 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 115 conjunts are in the unsatisfiable core [2019-12-07 17:17:17,890 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:17:18,162 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:18,162 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 17:17:18,162 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:18,164 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:18,165 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:18,165 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 17:17:18,242 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 17:17:18,242 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:18,246 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:18,246 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:18,246 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 17:17:18,292 INFO L377 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 21 treesize of output 20 [2019-12-07 17:17:18,292 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:18,296 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:18,296 INFO L534 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. [2019-12-07 17:17:18,296 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-12-07 17:17:18,421 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:18,421 INFO L377 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 1 case distinctions, treesize of input 28 treesize of output 52 [2019-12-07 17:17:18,422 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:18,443 INFO L614 ElimStorePlain]: treesize reduction 22, result has 56.0 percent of original size [2019-12-07 17:17:18,443 INFO L534 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. [2019-12-07 17:17:18,444 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-12-07 17:17:18,528 INFO L343 Elim1Store]: treesize reduction 34, result has 60.0 percent of original size [2019-12-07 17:17:18,528 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 70 [2019-12-07 17:17:18,529 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:18,541 INFO L614 ElimStorePlain]: treesize reduction 58, result has 40.2 percent of original size [2019-12-07 17:17:18,541 INFO L534 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. [2019-12-07 17:17:18,541 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:39 [2019-12-07 17:17:19,700 WARN L860 $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 [2019-12-07 17:17:19,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:17:19,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:17:19,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:17:19,741 INFO L343 Elim1Store]: treesize reduction 28, result has 65.0 percent of original size [2019-12-07 17:17:19,741 INFO L377 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 81 [2019-12-07 17:17:19,741 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:19,760 INFO L614 ElimStorePlain]: treesize reduction 42, result has 53.3 percent of original size [2019-12-07 17:17:19,760 INFO L534 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. [2019-12-07 17:17:19,761 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:45 [2019-12-07 17:17:20,029 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 17 [2019-12-07 17:17:20,029 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:20,036 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:20,036 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:20,037 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:104, output treesize:96 [2019-12-07 17:17:20,128 INFO L430 ElimStorePlain]: Different costs {2=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_66|], 12=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_66|]} [2019-12-07 17:17:20,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:17:20,131 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 80 [2019-12-07 17:17:20,131 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:20,141 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:20,239 INFO L343 Elim1Store]: treesize reduction 10, result has 95.4 percent of original size [2019-12-07 17:17:20,239 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 260 [2019-12-07 17:17:20,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:17:20,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:17:20,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:17:20,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:17:20,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:17:20,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:17:20,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:17:20,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:17:20,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:17:20,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:17:20,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:17:20,244 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-12-07 17:17:20,328 INFO L614 ElimStorePlain]: treesize reduction 1326, result has 10.8 percent of original size [2019-12-07 17:17:20,328 INFO L534 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. [2019-12-07 17:17:20,329 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:139, output treesize:150 [2019-12-07 17:17:22,084 INFO L430 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_int|], 12=[|#memory_$Pointer$.base|]} [2019-12-07 17:17:22,091 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:22,091 INFO L377 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 56 treesize of output 56 [2019-12-07 17:17:22,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:17:22,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:17:22,092 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:17:22,109 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:22,122 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:22,122 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 44 treesize of output 36 [2019-12-07 17:17:22,123 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:22,147 INFO L614 ElimStorePlain]: treesize reduction 26, result has 71.4 percent of original size [2019-12-07 17:17:22,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:17:22,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:17:22,169 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:22,169 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 71 [2019-12-07 17:17:22,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:17:22,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:17:22,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:17:22,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:17:22,171 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:22,176 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:22,177 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:22,177 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:105, output treesize:7 [2019-12-07 17:17:22,261 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2019-12-07 17:17:22,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:17:22,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 40] total 78 [2019-12-07 17:17:22,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542294749] [2019-12-07 17:17:22,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-12-07 17:17:22,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:22,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-12-07 17:17:22,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=5620, Unknown=1, NotChecked=150, Total=6006 [2019-12-07 17:17:22,262 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 78 states. [2019-12-07 17:17:29,999 WARN L192 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-12-07 17:17:32,705 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-12-07 17:17:34,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:34,597 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2019-12-07 17:17:34,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-07 17:17:34,597 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 86 [2019-12-07 17:17:34,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:34,598 INFO L225 Difference]: With dead ends: 125 [2019-12-07 17:17:34,598 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 17:17:34,598 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 112 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2992 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=630, Invalid=12029, Unknown=1, NotChecked=222, Total=12882 [2019-12-07 17:17:34,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 17:17:34,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 111. [2019-12-07 17:17:34,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 17:17:34,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2019-12-07 17:17:34,600 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 86 [2019-12-07 17:17:34,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:34,601 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2019-12-07 17:17:34,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-12-07 17:17:34,601 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2019-12-07 17:17:34,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 17:17:34,601 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:34,601 INFO L410 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] [2019-12-07 17:17:34,802 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:17:34,802 INFO L410 AbstractCegarLoop]: === Iteration 34 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:17:34,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:34,803 INFO L82 PathProgramCache]: Analyzing trace with hash -768581521, now seen corresponding path program 1 times [2019-12-07 17:17:34,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:34,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981689112] [2019-12-07 17:17:34,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:35,030 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 17:17:35,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981689112] [2019-12-07 17:17:35,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:35,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 17:17:35,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890627867] [2019-12-07 17:17:35,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 17:17:35,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:35,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:17:35,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:17:35,031 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand 16 states. [2019-12-07 17:17:35,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:35,534 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2019-12-07 17:17:35,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 17:17:35,534 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 91 [2019-12-07 17:17:35,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:35,535 INFO L225 Difference]: With dead ends: 122 [2019-12-07 17:17:35,535 INFO L226 Difference]: Without dead ends: 122 [2019-12-07 17:17:35,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-12-07 17:17:35,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-12-07 17:17:35,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 109. [2019-12-07 17:17:35,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 17:17:35,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2019-12-07 17:17:35,537 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 91 [2019-12-07 17:17:35,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:35,538 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2019-12-07 17:17:35,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 17:17:35,538 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2019-12-07 17:17:35,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 17:17:35,538 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:35,538 INFO L410 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] [2019-12-07 17:17:35,538 INFO L410 AbstractCegarLoop]: === Iteration 35 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:17:35,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:35,539 INFO L82 PathProgramCache]: Analyzing trace with hash -341337547, now seen corresponding path program 1 times [2019-12-07 17:17:35,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:35,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827377836] [2019-12-07 17:17:35,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:35,665 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-07 17:17:35,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827377836] [2019-12-07 17:17:35,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158431809] [2019-12-07 17:17:35,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:17:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:35,752 INFO L264 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 17:17:35,754 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:17:35,758 INFO L377 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 9 [2019-12-07 17:17:35,759 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:35,760 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:35,760 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:35,760 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-12-07 17:17:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-07 17:17:35,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:17:35,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 13 [2019-12-07 17:17:35,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607147124] [2019-12-07 17:17:35,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 17:17:35,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:35,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 17:17:35,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:17:35,767 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 14 states. [2019-12-07 17:17:36,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:36,889 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2019-12-07 17:17:36,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 17:17:36,891 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 94 [2019-12-07 17:17:36,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:36,893 INFO L225 Difference]: With dead ends: 129 [2019-12-07 17:17:36,893 INFO L226 Difference]: Without dead ends: 129 [2019-12-07 17:17:36,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2019-12-07 17:17:36,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-12-07 17:17:36,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 109. [2019-12-07 17:17:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 17:17:36,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2019-12-07 17:17:36,901 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 94 [2019-12-07 17:17:36,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:36,902 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2019-12-07 17:17:36,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 17:17:36,902 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2019-12-07 17:17:36,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 17:17:36,903 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:36,904 INFO L410 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] [2019-12-07 17:17:37,104 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:17:37,105 INFO L410 AbstractCegarLoop]: === Iteration 36 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:17:37,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:37,106 INFO L82 PathProgramCache]: Analyzing trace with hash -341337546, now seen corresponding path program 1 times [2019-12-07 17:17:37,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:37,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499769943] [2019-12-07 17:17:37,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:38,467 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 17:17:38,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499769943] [2019-12-07 17:17:38,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908042850] [2019-12-07 17:17:38,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:17:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:38,555 INFO L264 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 126 conjunts are in the unsatisfiable core [2019-12-07 17:17:38,557 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:17:38,638 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:38,638 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 17:17:38,638 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:38,644 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:38,644 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:38,644 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-12-07 17:17:38,725 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 17:17:38,725 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:38,735 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:38,737 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 17:17:38,737 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:38,745 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:38,745 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:38,745 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2019-12-07 17:17:38,802 INFO L377 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 19 treesize of output 18 [2019-12-07 17:17:38,802 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:38,812 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:38,815 INFO L377 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 19 treesize of output 18 [2019-12-07 17:17:38,815 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:38,824 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:38,825 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:38,825 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2019-12-07 17:17:38,938 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:38,938 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 68 [2019-12-07 17:17:38,939 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:38,968 INFO L614 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2019-12-07 17:17:38,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:17:38,990 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:38,990 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 82 [2019-12-07 17:17:38,991 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:39,020 INFO L614 ElimStorePlain]: treesize reduction 40, result has 57.0 percent of original size [2019-12-07 17:17:39,020 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:39,021 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:53 [2019-12-07 17:17:39,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:17:39,095 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:17:39,119 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:39,119 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 70 treesize of output 122 [2019-12-07 17:17:39,120 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:39,158 INFO L614 ElimStorePlain]: treesize reduction 76, result has 54.8 percent of original size [2019-12-07 17:17:39,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:17:39,165 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:39,165 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 56 [2019-12-07 17:17:39,166 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:39,195 INFO L614 ElimStorePlain]: treesize reduction 16, result has 84.6 percent of original size [2019-12-07 17:17:39,195 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:39,195 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:91 [2019-12-07 17:17:40,936 WARN L860 $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 [2019-12-07 17:17:40,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:17:40,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:17:40,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:17:40,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:17:40,970 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:17:41,017 INFO L343 Elim1Store]: treesize reduction 36, result has 71.4 percent of original size [2019-12-07 17:17:41,017 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 149 [2019-12-07 17:17:41,018 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:41,063 INFO L614 ElimStorePlain]: treesize reduction 76, result has 61.8 percent of original size [2019-12-07 17:17:41,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:17:41,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:17:41,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:17:41,070 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:41,070 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 76 [2019-12-07 17:17:41,070 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:41,098 INFO L614 ElimStorePlain]: treesize reduction 40, result has 72.2 percent of original size [2019-12-07 17:17:41,098 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:41,098 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:132, output treesize:101 [2019-12-07 17:17:42,492 WARN L860 $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 [2019-12-07 17:17:42,495 INFO L430 ElimStorePlain]: Different costs {12=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_76|], 20=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_76|]} [2019-12-07 17:17:42,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:17:42,499 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:17:42,520 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:42,521 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 109 treesize of output 116 [2019-12-07 17:17:42,521 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:17:42,531 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:42,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:17:42,556 INFO L343 Elim1Store]: treesize reduction 40, result has 46.7 percent of original size [2019-12-07 17:17:42,556 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 63 [2019-12-07 17:17:42,556 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:42,568 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:42,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:17:42,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:17:42,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:17:42,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:17:42,569 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 17:17:42,570 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:122, output treesize:80 [2019-12-07 17:17:42,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:17:42,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:17:45,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:17:47,802 WARN L192 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 60 [2019-12-07 17:17:47,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:17:47,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:17:50,378 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 41 [2019-12-07 17:17:50,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:17:50,640 INFO L430 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 20=[|#memory_$Pointer$.offset|]} [2019-12-07 17:17:50,643 INFO L377 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 35 treesize of output 19 [2019-12-07 17:17:50,644 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:50,647 INFO L377 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 23 treesize of output 15 [2019-12-07 17:17:50,647 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:50,651 INFO L377 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 23 treesize of output 15 [2019-12-07 17:17:50,651 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:50,682 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:50,686 INFO L377 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 52 treesize of output 23 [2019-12-07 17:17:50,686 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:50,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:17:50,692 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 20 [2019-12-07 17:17:50,692 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:50,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:17:50,695 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2019-12-07 17:17:50,695 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:50,717 INFO L614 ElimStorePlain]: treesize reduction 19, result has 62.0 percent of original size [2019-12-07 17:17:50,717 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 17:17:50,718 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:188, output treesize:21 [2019-12-07 17:17:50,897 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2019-12-07 17:17:50,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:17:50,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 39] total 68 [2019-12-07 17:17:50,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714148670] [2019-12-07 17:17:50,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-12-07 17:17:50,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:50,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-12-07 17:17:50,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=4202, Unknown=4, NotChecked=262, Total=4692 [2019-12-07 17:17:50,898 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 69 states. [2019-12-07 17:17:55,804 WARN L192 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2019-12-07 17:18:00,262 WARN L192 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2019-12-07 17:18:04,496 WARN L192 SmtUtils]: Spent 4.07 s on a formula simplification that was a NOOP. DAG size: 76 [2019-12-07 17:18:09,250 WARN L192 SmtUtils]: Spent 4.50 s on a formula simplification. DAG size of input: 88 DAG size of output: 85 [2019-12-07 17:18:10,022 WARN L192 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2019-12-07 17:18:16,771 WARN L192 SmtUtils]: Spent 5.33 s on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2019-12-07 17:18:17,224 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-12-07 17:18:19,568 WARN L192 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2019-12-07 17:18:19,900 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-07 17:18:22,547 WARN L192 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2019-12-07 17:18:22,764 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-07 17:18:28,672 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-12-07 17:18:29,027 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-07 17:18:31,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:18:31,240 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2019-12-07 17:18:31,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-07 17:18:31,241 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 94 [2019-12-07 17:18:31,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:31,241 INFO L225 Difference]: With dead ends: 129 [2019-12-07 17:18:31,242 INFO L226 Difference]: Without dead ends: 129 [2019-12-07 17:18:31,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 75 SyntacticMatches, 7 SemanticMatches, 96 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2229 ImplicationChecksByTransitivity, 39.2s TimeCoverageRelationStatistics Valid=640, Invalid=8483, Unknown=5, NotChecked=378, Total=9506 [2019-12-07 17:18:31,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-12-07 17:18:31,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 111. [2019-12-07 17:18:31,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 17:18:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2019-12-07 17:18:31,244 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 94 [2019-12-07 17:18:31,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:31,244 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2019-12-07 17:18:31,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-12-07 17:18:31,245 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2019-12-07 17:18:31,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 17:18:31,245 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:31,245 INFO L410 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] [2019-12-07 17:18:31,445 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:18:31,446 INFO L410 AbstractCegarLoop]: === Iteration 37 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:18:31,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:31,447 INFO L82 PathProgramCache]: Analyzing trace with hash -308846807, now seen corresponding path program 1 times [2019-12-07 17:18:31,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:18:31,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44038337] [2019-12-07 17:18:31,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:18:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 17:18:31,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44038337] [2019-12-07 17:18:31,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:18:31,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 17:18:31,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110793104] [2019-12-07 17:18:31,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 17:18:31,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:18:31,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:18:31,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:18:31,616 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand 16 states. [2019-12-07 17:18:32,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:18:32,035 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2019-12-07 17:18:32,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 17:18:32,036 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 94 [2019-12-07 17:18:32,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:32,036 INFO L225 Difference]: With dead ends: 117 [2019-12-07 17:18:32,036 INFO L226 Difference]: Without dead ends: 115 [2019-12-07 17:18:32,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2019-12-07 17:18:32,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-12-07 17:18:32,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2019-12-07 17:18:32,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 17:18:32,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2019-12-07 17:18:32,038 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 94 [2019-12-07 17:18:32,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:32,039 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2019-12-07 17:18:32,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 17:18:32,039 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2019-12-07 17:18:32,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 17:18:32,039 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:32,039 INFO L410 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] [2019-12-07 17:18:32,039 INFO L410 AbstractCegarLoop]: === Iteration 38 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:18:32,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:32,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1991530699, now seen corresponding path program 1 times [2019-12-07 17:18:32,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:18:32,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146851143] [2019-12-07 17:18:32,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:18:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:32,181 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 17:18:32,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146851143] [2019-12-07 17:18:32,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:18:32,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 17:18:32,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738443779] [2019-12-07 17:18:32,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 17:18:32,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:18:32,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 17:18:32,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:18:32,182 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 15 states. [2019-12-07 17:18:32,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:18:32,643 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2019-12-07 17:18:32,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 17:18:32,643 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 95 [2019-12-07 17:18:32,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:32,644 INFO L225 Difference]: With dead ends: 113 [2019-12-07 17:18:32,644 INFO L226 Difference]: Without dead ends: 113 [2019-12-07 17:18:32,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-12-07 17:18:32,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-12-07 17:18:32,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2019-12-07 17:18:32,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 17:18:32,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2019-12-07 17:18:32,646 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 95 [2019-12-07 17:18:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:32,646 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2019-12-07 17:18:32,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 17:18:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2019-12-07 17:18:32,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 17:18:32,647 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:32,647 INFO L410 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] [2019-12-07 17:18:32,647 INFO L410 AbstractCegarLoop]: === Iteration 39 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:18:32,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:32,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1695836314, now seen corresponding path program 1 times [2019-12-07 17:18:32,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:18:32,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561640995] [2019-12-07 17:18:32,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:18:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:33,423 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 17:18:33,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561640995] [2019-12-07 17:18:33,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36353243] [2019-12-07 17:18:33,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:18:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:33,509 INFO L264 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 92 conjunts are in the unsatisfiable core [2019-12-07 17:18:33,511 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:18:33,564 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 17:18:33,564 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:33,567 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:33,567 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:33,568 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-12-07 17:18:33,652 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:33,653 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 17:18:33,653 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:33,656 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:33,657 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:33,657 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2019-12-07 17:18:33,723 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 17:18:33,723 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:33,729 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:33,729 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:33,729 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-12-07 17:18:33,771 INFO L377 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 21 treesize of output 20 [2019-12-07 17:18:33,771 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:33,776 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:33,777 INFO L534 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. [2019-12-07 17:18:33,777 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-12-07 17:18:33,885 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:33,885 INFO L377 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 1 case distinctions, treesize of input 28 treesize of output 52 [2019-12-07 17:18:33,885 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:33,902 INFO L614 ElimStorePlain]: treesize reduction 22, result has 60.0 percent of original size [2019-12-07 17:18:33,903 INFO L534 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. [2019-12-07 17:18:33,903 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-12-07 17:18:33,981 INFO L343 Elim1Store]: treesize reduction 34, result has 60.0 percent of original size [2019-12-07 17:18:33,982 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 75 [2019-12-07 17:18:33,982 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:33,998 INFO L614 ElimStorePlain]: treesize reduction 58, result has 46.3 percent of original size [2019-12-07 17:18:33,999 INFO L534 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. [2019-12-07 17:18:33,999 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:50 [2019-12-07 17:18:34,289 INFO L343 Elim1Store]: treesize reduction 10, result has 75.6 percent of original size [2019-12-07 17:18:34,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 49 [2019-12-07 17:18:34,290 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:34,291 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:34,292 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:34,292 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:53, output treesize:3 [2019-12-07 17:18:35,214 WARN L860 $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 [2019-12-07 17:18:35,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:35,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:35,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:35,251 INFO L343 Elim1Store]: treesize reduction 28, result has 65.0 percent of original size [2019-12-07 17:18:35,251 INFO L377 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 86 [2019-12-07 17:18:35,252 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:35,268 INFO L614 ElimStorePlain]: treesize reduction 18, result has 74.6 percent of original size [2019-12-07 17:18:35,268 INFO L534 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. [2019-12-07 17:18:35,269 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:50 [2019-12-07 17:18:35,290 INFO L343 Elim1Store]: treesize reduction 10, result has 75.6 percent of original size [2019-12-07 17:18:35,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 49 [2019-12-07 17:18:35,290 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:35,292 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:35,292 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:35,292 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:53, output treesize:3 [2019-12-07 17:18:36,404 WARN L860 $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 [2019-12-07 17:18:36,512 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-12-07 17:18:36,513 INFO L343 Elim1Store]: treesize reduction 10, result has 94.4 percent of original size [2019-12-07 17:18:36,513 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 206 [2019-12-07 17:18:36,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:18:36,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:18:36,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:18:36,515 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 17:18:36,561 INFO L614 ElimStorePlain]: treesize reduction 410, result has 12.4 percent of original size [2019-12-07 17:18:36,561 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:36,561 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:35 [2019-12-07 17:18:37,629 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-12-07 17:18:37,630 INFO L377 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 42 treesize of output 16 [2019-12-07 17:18:37,630 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 17:18:37,637 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:37,638 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:37,638 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:5 [2019-12-07 17:18:37,667 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 2 not checked. [2019-12-07 17:18:37,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:18:37,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 56 [2019-12-07 17:18:37,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717349033] [2019-12-07 17:18:37,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-12-07 17:18:37,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:18:37,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-12-07 17:18:37,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2809, Unknown=2, NotChecked=214, Total=3192 [2019-12-07 17:18:37,668 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand 57 states. [2019-12-07 17:18:43,766 WARN L192 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-12-07 17:18:46,485 WARN L192 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-12-07 17:18:47,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:18:47,931 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2019-12-07 17:18:47,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 17:18:47,931 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 97 [2019-12-07 17:18:47,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:47,931 INFO L225 Difference]: With dead ends: 114 [2019-12-07 17:18:47,931 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 17:18:47,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 81 SyntacticMatches, 7 SemanticMatches, 84 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1292 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=502, Invalid=6476, Unknown=2, NotChecked=330, Total=7310 [2019-12-07 17:18:47,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 17:18:47,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2019-12-07 17:18:47,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 17:18:47,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions. [2019-12-07 17:18:47,934 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 97 [2019-12-07 17:18:47,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:47,934 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 114 transitions. [2019-12-07 17:18:47,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-12-07 17:18:47,935 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2019-12-07 17:18:47,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 17:18:47,935 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:47,935 INFO L410 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] [2019-12-07 17:18:48,135 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:18:48,137 INFO L410 AbstractCegarLoop]: === Iteration 40 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:18:48,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:48,137 INFO L82 PathProgramCache]: Analyzing trace with hash -306307299, now seen corresponding path program 1 times [2019-12-07 17:18:48,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:18:48,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249859386] [2019-12-07 17:18:48,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:18:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 17:18:48,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249859386] [2019-12-07 17:18:48,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540424074] [2019-12-07 17:18:48,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:18:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:48,897 INFO L264 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 95 conjunts are in the unsatisfiable core [2019-12-07 17:18:48,899 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:18:48,913 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:48,913 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 17:18:48,914 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:48,918 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:48,918 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:48,919 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-12-07 17:18:48,929 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 17:18:48,929 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:48,934 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:48,934 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:48,934 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-12-07 17:18:48,967 INFO L377 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 21 treesize of output 20 [2019-12-07 17:18:48,967 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:48,972 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:48,972 INFO L534 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. [2019-12-07 17:18:48,972 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-12-07 17:18:49,059 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:49,059 INFO L377 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 1 case distinctions, treesize of input 28 treesize of output 52 [2019-12-07 17:18:49,059 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:49,076 INFO L614 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-12-07 17:18:49,076 INFO L534 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. [2019-12-07 17:18:49,076 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2019-12-07 17:18:49,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:49,132 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:49,132 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 84 [2019-12-07 17:18:49,133 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:49,149 INFO L614 ElimStorePlain]: treesize reduction 58, result has 42.0 percent of original size [2019-12-07 17:18:49,149 INFO L534 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. [2019-12-07 17:18:49,149 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:42 [2019-12-07 17:18:50,097 WARN L860 $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 [2019-12-07 17:18:50,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:50,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:50,135 INFO L343 Elim1Store]: treesize reduction 28, result has 64.1 percent of original size [2019-12-07 17:18:50,135 INFO L377 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 77 [2019-12-07 17:18:50,136 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:50,151 INFO L614 ElimStorePlain]: treesize reduction 38, result has 50.6 percent of original size [2019-12-07 17:18:50,152 INFO L534 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. [2019-12-07 17:18:50,152 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:36 [2019-12-07 17:18:51,213 WARN L860 $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 [2019-12-07 17:18:51,290 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:51,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 249 [2019-12-07 17:18:51,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:18:51,291 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:51,316 INFO L614 ElimStorePlain]: treesize reduction 167, result has 20.9 percent of original size [2019-12-07 17:18:51,316 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:51,317 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:23 [2019-12-07 17:19:03,885 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 2 not checked. [2019-12-07 17:19:03,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:19:03,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 54 [2019-12-07 17:19:03,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319406006] [2019-12-07 17:19:03,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-12-07 17:19:03,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:19:03,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-12-07 17:19:03,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2486, Unknown=2, NotChecked=202, Total=2862 [2019-12-07 17:19:03,886 INFO L87 Difference]: Start difference. First operand 111 states and 114 transitions. Second operand 54 states. [2019-12-07 17:19:26,723 WARN L192 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-12-07 17:19:36,233 WARN L192 SmtUtils]: Spent 3.25 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-12-07 17:19:39,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:19:39,275 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2019-12-07 17:19:39,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 17:19:39,275 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 100 [2019-12-07 17:19:39,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:19:39,276 INFO L225 Difference]: With dead ends: 114 [2019-12-07 17:19:39,276 INFO L226 Difference]: Without dead ends: 109 [2019-12-07 17:19:39,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 90 SyntacticMatches, 8 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1239 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=458, Invalid=4948, Unknown=4, NotChecked=290, Total=5700 [2019-12-07 17:19:39,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-07 17:19:39,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-12-07 17:19:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-12-07 17:19:39,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-12-07 17:19:39,278 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 100 [2019-12-07 17:19:39,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:19:39,278 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-12-07 17:19:39,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-12-07 17:19:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-12-07 17:19:39,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 17:19:39,279 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:19:39,279 INFO L410 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, 1] [2019-12-07 17:19:39,479 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:19:39,480 INFO L410 AbstractCegarLoop]: === Iteration 41 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:19:39,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:19:39,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1040465254, now seen corresponding path program 1 times [2019-12-07 17:19:39,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:19:39,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223457168] [2019-12-07 17:19:39,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:19:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:40,914 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 17:19:40,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223457168] [2019-12-07 17:19:40,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404108465] [2019-12-07 17:19:40,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:19:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:41,004 INFO L264 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 141 conjunts are in the unsatisfiable core [2019-12-07 17:19:41,006 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:19:41,162 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:41,162 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 17:19:41,162 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:19:41,170 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:41,170 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:19:41,170 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2019-12-07 17:19:41,276 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 17:19:41,276 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:19:41,288 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:41,291 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 17:19:41,291 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:19:41,302 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:41,302 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:19:41,302 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2019-12-07 17:19:41,364 INFO L377 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 19 treesize of output 18 [2019-12-07 17:19:41,364 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:19:41,378 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:41,380 INFO L377 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 19 treesize of output 18 [2019-12-07 17:19:41,381 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:19:41,393 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:41,393 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:19:41,393 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:47 [2019-12-07 17:19:41,535 INFO L377 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 52 [2019-12-07 17:19:41,535 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:19:41,578 INFO L614 ElimStorePlain]: treesize reduction 3, result has 96.4 percent of original size [2019-12-07 17:19:41,582 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:19:41,591 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:41,592 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 63 [2019-12-07 17:19:41,592 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:19:41,631 INFO L614 ElimStorePlain]: treesize reduction 28, result has 73.3 percent of original size [2019-12-07 17:19:41,631 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:19:41,631 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:77 [2019-12-07 17:19:41,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:41,734 INFO L377 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2019-12-07 17:19:41,734 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:19:41,758 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:41,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:41,763 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:19:41,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:41,765 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:19:41,777 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:41,778 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 83 [2019-12-07 17:19:41,778 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:19:41,824 INFO L614 ElimStorePlain]: treesize reduction 32, result has 70.4 percent of original size [2019-12-07 17:19:41,824 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:19:41,824 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:93 [2019-12-07 17:19:42,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:42,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:42,219 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:19:42,219 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:19:42,226 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:42,226 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 47 [2019-12-07 17:19:42,226 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:19:42,241 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:42,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:42,244 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 31 treesize of output 13 [2019-12-07 17:19:42,244 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:19:42,251 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:42,251 INFO L534 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. [2019-12-07 17:19:42,252 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:99, output treesize:12 [2019-12-07 17:19:42,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:42,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:42,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:42,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:42,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:42,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:42,492 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:19:42,493 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:19:42,507 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:42,507 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 77 [2019-12-07 17:19:42,508 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:19:42,561 INFO L614 ElimStorePlain]: treesize reduction 60, result has 67.9 percent of original size [2019-12-07 17:19:42,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:42,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:42,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:42,566 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2019-12-07 17:19:42,566 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:19:42,584 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:42,584 INFO L534 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. [2019-12-07 17:19:42,584 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:136, output treesize:108 [2019-12-07 17:19:42,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:42,666 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:19:42,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:42,667 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:19:42,674 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:42,674 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 47 [2019-12-07 17:19:42,675 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:19:42,688 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:42,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:42,691 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 31 treesize of output 13 [2019-12-07 17:19:42,691 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:19:42,698 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:42,698 INFO L534 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. [2019-12-07 17:19:42,699 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:99, output treesize:12 [2019-12-07 17:19:42,956 INFO L430 ElimStorePlain]: Different costs {10=[|v_#memory_$Pointer$.offset_BEFORE_CALL_13|], 18=[|v_#memory_$Pointer$.base_BEFORE_CALL_38|]} [2019-12-07 17:19:42,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:42,959 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 78 treesize of output 44 [2019-12-07 17:19:42,959 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:19:42,973 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:42,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:42,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:42,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:42,978 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:19:42,978 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:19:42,984 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:42,985 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 71 treesize of output 74 [2019-12-07 17:19:42,985 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:19:43,008 INFO L614 ElimStorePlain]: treesize reduction 30, result has 68.8 percent of original size [2019-12-07 17:19:43,008 INFO L534 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. [2019-12-07 17:19:43,008 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:137, output treesize:66 [2019-12-07 17:19:44,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:19:44,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:44,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:44,273 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:19:44,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:44,274 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:19:44,290 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:44,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 64 treesize of output 63 [2019-12-07 17:19:44,290 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:19:44,303 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:44,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:19:44,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:19:44,304 INFO L534 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. [2019-12-07 17:19:44,304 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:82, output treesize:29 [2019-12-07 17:19:44,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:19:44,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:19:44,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:19:44,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:19:44,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:19:44,536 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 17:19:44,537 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:19:44,542 INFO L614 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-12-07 17:19:44,543 INFO L534 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. [2019-12-07 17:19:44,543 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-12-07 17:19:44,660 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 17:19:44,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:19:44,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 39] total 70 [2019-12-07 17:19:44,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915157970] [2019-12-07 17:19:44,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-12-07 17:19:44,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:19:44,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-12-07 17:19:44,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=4614, Unknown=0, NotChecked=0, Total=4830 [2019-12-07 17:19:44,661 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 70 states. [2019-12-07 17:19:46,712 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 74 [2019-12-07 17:19:49,233 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-12-07 17:19:49,451 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-12-07 17:19:49,912 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 91 [2019-12-07 17:19:50,411 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 91 [2019-12-07 17:19:51,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:19:51,533 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2019-12-07 17:19:51,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 17:19:51,535 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 100 [2019-12-07 17:19:51,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:19:51,536 INFO L225 Difference]: With dead ends: 100 [2019-12-07 17:19:51,536 INFO L226 Difference]: Without dead ends: 100 [2019-12-07 17:19:51,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 73 SyntacticMatches, 9 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2018 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=627, Invalid=8493, Unknown=0, NotChecked=0, Total=9120 [2019-12-07 17:19:51,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-07 17:19:51,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-12-07 17:19:51,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-07 17:19:51,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-12-07 17:19:51,541 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 100 [2019-12-07 17:19:51,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:19:51,542 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-12-07 17:19:51,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-12-07 17:19:51,542 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-12-07 17:19:51,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-07 17:19:51,543 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:19:51,544 INFO L410 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, 1, 1] [2019-12-07 17:19:51,744 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:19:51,745 INFO L410 AbstractCegarLoop]: === Iteration 42 === [dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION]=== [2019-12-07 17:19:51,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:19:51,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1926649918, now seen corresponding path program 1 times [2019-12-07 17:19:51,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:19:51,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201176737] [2019-12-07 17:19:51,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:19:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 17:19:52,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201176737] [2019-12-07 17:19:52,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932420412] [2019-12-07 17:19:52,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:19:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:52,821 INFO L264 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 113 conjunts are in the unsatisfiable core [2019-12-07 17:19:52,823 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:19:53,153 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:53,154 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 23 treesize of output 63 [2019-12-07 17:19:53,155 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:19:53,296 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2019-12-07 17:19:53,297 INFO L614 ElimStorePlain]: treesize reduction 28, result has 54.8 percent of original size [2019-12-07 17:19:53,297 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:19:53,298 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:34 [2019-12-07 17:19:53,712 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-12-07 17:19:53,712 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:19:53,751 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:53,751 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:19:53,752 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-12-07 17:19:54,018 INFO L377 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 21 treesize of output 20 [2019-12-07 17:19:54,019 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:19:54,089 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:54,089 INFO L534 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. [2019-12-07 17:19:54,090 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:47 [2019-12-07 17:19:54,646 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:54,647 INFO L377 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 1 case distinctions, treesize of input 28 treesize of output 52 [2019-12-07 17:19:54,647 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:19:54,756 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-12-07 17:19:54,757 INFO L614 ElimStorePlain]: treesize reduction 22, result has 71.1 percent of original size [2019-12-07 17:19:54,758 INFO L534 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. [2019-12-07 17:19:54,758 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2019-12-07 17:19:54,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:55,027 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:55,028 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 94 [2019-12-07 17:19:55,029 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:19:55,159 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-12-07 17:19:55,159 INFO L614 ElimStorePlain]: treesize reduction 58, result has 57.0 percent of original size [2019-12-07 17:19:55,160 INFO L534 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. [2019-12-07 17:19:55,160 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:77 [2019-12-07 17:19:56,215 INFO L377 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 17 treesize of output 7 [2019-12-07 17:19:56,216 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:19:56,266 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:56,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:19:56,323 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:56,324 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 49 [2019-12-07 17:19:56,325 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:19:56,355 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:19:56,356 INFO L534 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. [2019-12-07 17:19:56,356 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:80, output treesize:18 [2019-12-07 17:20:05,518 WARN L192 SmtUtils]: Spent 850.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-12-07 17:20:05,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:20:05,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:20:05,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:20:05,581 INFO L343 Elim1Store]: treesize reduction 28, result has 65.0 percent of original size [2019-12-07 17:20:05,581 INFO L377 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 91 [2019-12-07 17:20:05,582 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:20:05,619 INFO L614 ElimStorePlain]: treesize reduction 18, result has 83.9 percent of original size [2019-12-07 17:20:05,620 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 17:20:05,620 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:113, output treesize:91 [2019-12-07 17:20:05,705 INFO L377 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 17 treesize of output 7 [2019-12-07 17:20:05,705 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:20:05,716 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:20:05,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:20:05,728 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:20:05,728 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 49 [2019-12-07 17:20:05,729 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:20:05,736 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:20:05,736 INFO L534 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. [2019-12-07 17:20:05,736 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:80, output treesize:18 [2019-12-07 17:20:20,204 WARN L192 SmtUtils]: Spent 1.63 s on a formula simplification that was a NOOP. DAG size: 29 [2019-12-07 17:20:20,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:20:20,261 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:20:20,261 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 92 treesize of output 211 [2019-12-07 17:20:20,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:20,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:20:20,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:20,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:20,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:20:20,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:20,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:20,264 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-12-07 17:20:20,351 INFO L614 ElimStorePlain]: treesize reduction 722, result has 15.5 percent of original size [2019-12-07 17:20:20,351 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 17:20:20,351 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:122, output treesize:125 [2019-12-07 17:20:20,473 INFO L377 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 15 treesize of output 7 [2019-12-07 17:20:20,473 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:20:20,480 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:20:20,480 INFO L534 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. [2019-12-07 17:20:20,480 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:42 [2019-12-07 17:20:20,690 INFO L377 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 15 treesize of output 7 [2019-12-07 17:20:20,690 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:20:20,698 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:20:20,698 INFO L534 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. [2019-12-07 17:20:20,698 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:42 [2019-12-07 17:20:21,104 INFO L377 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 15 treesize of output 7 [2019-12-07 17:20:21,104 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:20:21,113 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:20:21,115 INFO L377 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 15 treesize of output 7 [2019-12-07 17:20:21,115 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:20:21,123 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:20:21,123 INFO L534 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. [2019-12-07 17:20:21,123 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:31 [2019-12-07 17:20:23,559 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2019-12-07 17:20:25,657 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2019-12-07 17:20:27,773 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 30 [2019-12-07 17:20:27,782 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:20:27,782 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2019-12-07 17:20:27,783 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:20:27,803 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:20:27,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:20:27,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:20:27,807 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:20:27,808 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:20:27,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:20:27,809 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:20:27,815 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:20:27,815 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 61 treesize of output 41 [2019-12-07 17:20:27,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:27,816 INFO L534 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 17:20:27,836 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:20:27,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:27,837 INFO L534 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. [2019-12-07 17:20:27,837 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:102, output treesize:51 [2019-12-07 17:20:28,024 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 17:20:28,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:20:28,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 38] total 67 [2019-12-07 17:20:28,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132758184] [2019-12-07 17:20:28,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-12-07 17:20:28,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:20:28,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-12-07 17:20:28,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=4316, Unknown=19, NotChecked=0, Total=4556 [2019-12-07 17:20:28,025 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 68 states. [2019-12-07 17:20:54,797 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 64 [2019-12-07 17:21:07,191 WARN L192 SmtUtils]: Spent 702.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 17:21:19,908 WARN L192 SmtUtils]: Spent 1.23 s on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 17:21:30,899 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 38 [2019-12-07 17:21:33,034 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 41 [2019-12-07 17:21:35,196 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 17:21:39,369 WARN L192 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2019-12-07 17:21:39,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:21:39,403 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2019-12-07 17:21:39,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 17:21:39,404 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 106 [2019-12-07 17:21:39,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:21:39,404 INFO L225 Difference]: With dead ends: 98 [2019-12-07 17:21:39,404 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 17:21:39,405 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 83 SyntacticMatches, 7 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2192 ImplicationChecksByTransitivity, 53.0s TimeCoverageRelationStatistics Valid=552, Invalid=8547, Unknown=21, NotChecked=0, Total=9120 [2019-12-07 17:21:39,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 17:21:39,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 17:21:39,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 17:21:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 17:21:39,405 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2019-12-07 17:21:39,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:21:39,405 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:21:39,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-12-07 17:21:39,405 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 17:21:39,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 17:21:39,606 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:21:39,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:21:39 BoogieIcfgContainer [2019-12-07 17:21:39,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:21:39,614 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:21:39,614 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:21:39,614 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:21:39,614 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:14:33" (3/4) ... [2019-12-07 17:21:39,617 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 17:21:39,621 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-07 17:21:39,621 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-12-07 17:21:39,621 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_destroy [2019-12-07 17:21:39,621 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-12-07 17:21:39,622 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-12-07 17:21:39,622 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-07 17:21:39,622 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_create [2019-12-07 17:21:39,622 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_update_at [2019-12-07 17:21:39,622 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-12-07 17:21:39,622 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_get_data_at [2019-12-07 17:21:39,627 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2019-12-07 17:21:39,627 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-12-07 17:21:39,627 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 17:21:39,627 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 17:21:39,665 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3beaa2c2-4761-4ef4-bc69-5f4546bd1dd8/bin/uautomizer/witness.graphml [2019-12-07 17:21:39,666 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:21:39,667 INFO L168 Benchmark]: Toolchain (without parser) took 427375.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 934.1 MB in the beginning and 961.8 MB in the end (delta: -27.8 MB). Peak memory consumption was 90.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:21:39,667 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:21:39,667 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.4 MB). Free memory was 934.1 MB in the beginning and 1.1 GB in the end (delta: -126.5 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:21:39,667 INFO L168 Benchmark]: Boogie Preprocessor took 41.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:21:39,668 INFO L168 Benchmark]: RCFGBuilder took 381.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.7 MB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:21:39,668 INFO L168 Benchmark]: TraceAbstraction took 426577.30 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.1 MB). Free memory was 995.7 MB in the beginning and 970.7 MB in the end (delta: 25.0 MB). Peak memory consumption was 60.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:21:39,668 INFO L168 Benchmark]: Witness Printer took 51.89 ms. Allocated memory is still 1.1 GB. Free memory was 970.7 MB in the beginning and 961.8 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:21:39,670 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 319.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.4 MB). Free memory was 934.1 MB in the beginning and 1.1 GB in the end (delta: -126.5 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 381.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.7 MB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 426577.30 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.1 MB). Free memory was 995.7 MB in the beginning and 970.7 MB in the end (delta: 25.0 MB). Peak memory consumption was 60.1 MB. Max. memory is 11.5 GB. * Witness Printer took 51.89 ms. Allocated memory is still 1.1 GB. Free memory was 970.7 MB in the beginning and 961.8 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 592]: 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: 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: 632]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 615]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: 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: 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: 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: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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 - 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 - AllSpecificationsHoldResult: All specifications hold 34 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 121 locations, 34 error locations. Result: SAFE, OverallTime: 426.5s, OverallIterations: 42, TraceHistogramMax: 3, AutomataDifference: 279.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2800 SDtfs, 7937 SDslu, 13516 SDs, 0 SdLazy, 50374 SolverSat, 1878 SolverUnsat, 103 SolverUnknown, 0 SolverNotchecked, 165.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3144 GetRequests, 1649 SyntacticMatches, 86 SemanticMatches, 1409 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 19242 ImplicationChecksByTransitivity, 239.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 42 MinimizatonAttempts, 818 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 138.6s InterpolantComputationTime, 4125 NumberOfCodeBlocks, 4125 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 4060 ConstructedInterpolants, 344 QuantifiedInterpolants, 4155078 SizeOfPredicates, 334 NumberOfNonLiveVariables, 7988 ConjunctsInSsa, 1253 ConjunctsInUnsatCore, 65 InterpolantComputations, 21 PerfectInterpolantSequences, 917/1357 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: 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...