./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.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_8e498345-0300-4b84-9e51-506bbbc04685/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/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 16891def4f6ae6ab6c00fe328146dbdee1a68356 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 18:22:12,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:22:12,593 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:22:12,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:22:12,600 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:22:12,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:22:12,602 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:22:12,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:22:12,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:22:12,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:22:12,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:22:12,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:22:12,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:22:12,607 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:22:12,608 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:22:12,609 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:22:12,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:22:12,610 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:22:12,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:22:12,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:22:12,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:22:12,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:22:12,615 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:22:12,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:22:12,617 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:22:12,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:22:12,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:22:12,618 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:22:12,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:22:12,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:22:12,619 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:22:12,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:22:12,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:22:12,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:22:12,621 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:22:12,621 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:22:12,621 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:22:12,622 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:22:12,622 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:22:12,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:22:12,623 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:22:12,623 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 18:22:12,632 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:22:12,633 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:22:12,633 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:22:12,634 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:22:12,634 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:22:12,634 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:22:12,634 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:22:12,634 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 18:22:12,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:22:12,634 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:22:12,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:22:12,635 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 18:22:12,635 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 18:22:12,635 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 18:22:12,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:22:12,635 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 18:22:12,635 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:22:12,635 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:22:12,636 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:22:12,636 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:22:12,636 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:22:12,636 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:22:12,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:22:12,636 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:22:12,636 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:22:12,636 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:22:12,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:22:12,637 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:22:12,637 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_8e498345-0300-4b84-9e51-506bbbc04685/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 -> 16891def4f6ae6ab6c00fe328146dbdee1a68356 [2019-12-07 18:22:12,734 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:22:12,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:22:12,743 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:22:12,744 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:22:12,745 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:22:12,745 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/bin/uautomizer/../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2019-12-07 18:22:12,781 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/bin/uautomizer/data/3d7ed7065/9bafb9f1849d46dabc48bb6a2ce523fa/FLAG94dda74de [2019-12-07 18:22:13,173 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:22:13,173 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2019-12-07 18:22:13,182 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/bin/uautomizer/data/3d7ed7065/9bafb9f1849d46dabc48bb6a2ce523fa/FLAG94dda74de [2019-12-07 18:22:13,191 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/bin/uautomizer/data/3d7ed7065/9bafb9f1849d46dabc48bb6a2ce523fa [2019-12-07 18:22:13,192 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:22:13,193 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 18:22:13,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:22:13,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:22:13,196 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:22:13,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:22:13" (1/1) ... [2019-12-07 18:22:13,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dd5798b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:13, skipping insertion in model container [2019-12-07 18:22:13,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:22:13" (1/1) ... [2019-12-07 18:22:13,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:22:13,235 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:22:13,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:22:13,484 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:22:13,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:22:13,552 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:22:13,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:13 WrapperNode [2019-12-07 18:22:13,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:22:13,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:22:13,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:22:13,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:22:13,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:13" (1/1) ... [2019-12-07 18:22:13,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:13" (1/1) ... [2019-12-07 18:22:13,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:13" (1/1) ... [2019-12-07 18:22:13,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:13" (1/1) ... [2019-12-07 18:22:13,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:13" (1/1) ... [2019-12-07 18:22:13,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:13" (1/1) ... [2019-12-07 18:22:13,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:13" (1/1) ... [2019-12-07 18:22:13,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:22:13,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:22:13,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:22:13,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:22:13,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/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 18:22:13,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 18:22:13,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:22:13,635 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 18:22:13,635 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 18:22:13,635 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-12-07 18:22:13,635 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-12-07 18:22:13,635 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-12-07 18:22:13,635 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2019-12-07 18:22:13,635 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2019-12-07 18:22:13,636 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2019-12-07 18:22:13,636 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 18:22:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 18:22:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 18:22:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 18:22:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 18:22:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 18:22:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 18:22:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 18:22:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 18:22:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 18:22:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 18:22:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 18:22:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 18:22:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 18:22:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 18:22:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 18:22:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 18:22:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 18:22:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 18:22:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 18:22:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 18:22:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 18:22:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 18:22:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 18:22:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 18:22:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 18:22:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 18:22:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 18:22:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 18:22:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 18:22:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 18:22:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 18:22:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 18:22:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 18:22:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 18:22:13,638 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 18:22:13,639 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 18:22:13,639 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 18:22:13,639 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 18:22:13,639 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 18:22:13,639 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 18:22:13,639 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 18:22:13,639 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 18:22:13,639 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 18:22:13,639 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 18:22:13,639 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 18:22:13,639 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 18:22:13,639 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 18:22:13,639 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 18:22:13,639 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 18:22:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 18:22:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 18:22:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 18:22:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 18:22:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 18:22:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 18:22:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 18:22:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 18:22:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-12-07 18:22:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 18:22:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 18:22:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 18:22:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 18:22:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 18:22:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 18:22:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 18:22:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 18:22:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 18:22:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 18:22:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 18:22:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 18:22:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 18:22:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 18:22:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 18:22:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 18:22:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 18:22:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 18:22:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 18:22:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 18:22:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 18:22:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 18:22:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 18:22:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 18:22:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 18:22:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 18:22:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 18:22:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 18:22:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 18:22:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 18:22:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 18:22:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 18:22:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 18:22:13,643 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 18:22:13,643 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 18:22:13,643 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 18:22:13,643 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 18:22:13,643 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 18:22:13,643 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 18:22:13,643 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 18:22:13,643 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 18:22:13,643 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 18:22:13,643 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 18:22:13,643 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 18:22:13,643 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 18:22:13,643 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 18:22:13,643 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 18:22:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 18:22:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-12-07 18:22:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-12-07 18:22:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 18:22:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 18:22:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:22:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-12-07 18:22:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2019-12-07 18:22:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 18:22:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:22:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2019-12-07 18:22:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 18:22:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2019-12-07 18:22:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 18:22:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 18:22:13,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:22:13,880 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-12-07 18:22:13,980 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:22:13,980 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-07 18:22:13,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:22:13 BoogieIcfgContainer [2019-12-07 18:22:13,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:22:13,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:22:13,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:22:13,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:22:13,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:22:13" (1/3) ... [2019-12-07 18:22:13,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8d27e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:22:13, skipping insertion in model container [2019-12-07 18:22:13,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:13" (2/3) ... [2019-12-07 18:22:13,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8d27e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:22:13, skipping insertion in model container [2019-12-07 18:22:13,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:22:13" (3/3) ... [2019-12-07 18:22:13,987 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2019-12-07 18:22:13,995 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:22:14,000 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 34 error locations. [2019-12-07 18:22:14,007 INFO L249 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2019-12-07 18:22:14,021 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:22:14,021 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 18:22:14,021 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:22:14,021 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:22:14,021 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:22:14,021 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:22:14,021 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:22:14,021 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:22:14,034 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2019-12-07 18:22:14,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 18:22:14,040 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:14,040 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:14,040 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 18:22:14,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:14,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1377994719, now seen corresponding path program 1 times [2019-12-07 18:22:14,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:14,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503641475] [2019-12-07 18:22:14,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:14,182 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 18:22:14,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503641475] [2019-12-07 18:22:14,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:14,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:22:14,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125772432] [2019-12-07 18:22:14,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:22:14,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:14,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:22:14,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:22:14,197 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 4 states. [2019-12-07 18:22:14,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:14,424 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2019-12-07 18:22:14,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:22:14,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 18:22:14,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:14,436 INFO L225 Difference]: With dead ends: 130 [2019-12-07 18:22:14,436 INFO L226 Difference]: Without dead ends: 124 [2019-12-07 18:22:14,437 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 18:22:14,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-12-07 18:22:14,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 105. [2019-12-07 18:22:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-07 18:22:14,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2019-12-07 18:22:14,470 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 12 [2019-12-07 18:22:14,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:14,471 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2019-12-07 18:22:14,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:22:14,471 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2019-12-07 18:22:14,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 18:22:14,471 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:14,471 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:14,472 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 18:22:14,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:14,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1377994718, now seen corresponding path program 1 times [2019-12-07 18:22:14,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:14,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8859069] [2019-12-07 18:22:14,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:14,537 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 18:22:14,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8859069] [2019-12-07 18:22:14,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:14,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:22:14,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949117721] [2019-12-07 18:22:14,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:22:14,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:14,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:22:14,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:22:14,540 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand 4 states. [2019-12-07 18:22:14,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:14,690 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2019-12-07 18:22:14,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:22:14,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 18:22:14,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:14,692 INFO L225 Difference]: With dead ends: 121 [2019-12-07 18:22:14,692 INFO L226 Difference]: Without dead ends: 121 [2019-12-07 18:22:14,693 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 18:22:14,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-12-07 18:22:14,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2019-12-07 18:22:14,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 18:22:14,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2019-12-07 18:22:14,700 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 12 [2019-12-07 18:22:14,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:14,700 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2019-12-07 18:22:14,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:22:14,701 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2019-12-07 18:22:14,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:22:14,701 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:14,701 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 18:22:14,701 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 18:22:14,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:14,702 INFO L82 PathProgramCache]: Analyzing trace with hash 379609462, now seen corresponding path program 1 times [2019-12-07 18:22:14,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:14,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862031391] [2019-12-07 18:22:14,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:14,786 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 18:22:14,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862031391] [2019-12-07 18:22:14,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:14,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:22:14,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704916298] [2019-12-07 18:22:14,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:22:14,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:14,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:22:14,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:22:14,787 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 7 states. [2019-12-07 18:22:15,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:15,082 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2019-12-07 18:22:15,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:22:15,083 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-12-07 18:22:15,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:15,084 INFO L225 Difference]: With dead ends: 122 [2019-12-07 18:22:15,084 INFO L226 Difference]: Without dead ends: 122 [2019-12-07 18:22:15,084 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 18:22:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-12-07 18:22:15,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 103. [2019-12-07 18:22:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-12-07 18:22:15,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-12-07 18:22:15,091 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 20 [2019-12-07 18:22:15,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:15,092 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-12-07 18:22:15,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:22:15,092 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-12-07 18:22:15,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 18:22:15,092 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:15,093 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 18:22:15,093 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 18:22:15,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:15,093 INFO L82 PathProgramCache]: Analyzing trace with hash -450848534, now seen corresponding path program 1 times [2019-12-07 18:22:15,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:15,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529556248] [2019-12-07 18:22:15,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:15,236 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 18:22:15,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529556248] [2019-12-07 18:22:15,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:15,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:22:15,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191537406] [2019-12-07 18:22:15,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:22:15,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:15,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:22:15,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:22:15,238 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 9 states. [2019-12-07 18:22:15,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:15,560 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2019-12-07 18:22:15,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:22:15,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-12-07 18:22:15,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:15,562 INFO L225 Difference]: With dead ends: 122 [2019-12-07 18:22:15,562 INFO L226 Difference]: Without dead ends: 122 [2019-12-07 18:22:15,563 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 18:22:15,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-12-07 18:22:15,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 102. [2019-12-07 18:22:15,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 18:22:15,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2019-12-07 18:22:15,568 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 30 [2019-12-07 18:22:15,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:15,569 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2019-12-07 18:22:15,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:22:15,569 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2019-12-07 18:22:15,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 18:22:15,569 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:15,570 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 18:22:15,570 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 18:22:15,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:15,570 INFO L82 PathProgramCache]: Analyzing trace with hash -450848535, now seen corresponding path program 1 times [2019-12-07 18:22:15,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:15,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161919884] [2019-12-07 18:22:15,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:15,659 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 18:22:15,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161919884] [2019-12-07 18:22:15,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:15,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:22:15,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965475648] [2019-12-07 18:22:15,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:22:15,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:15,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:22:15,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:22:15,660 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 8 states. [2019-12-07 18:22:15,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:15,945 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2019-12-07 18:22:15,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:22:15,945 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-12-07 18:22:15,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:15,946 INFO L225 Difference]: With dead ends: 121 [2019-12-07 18:22:15,946 INFO L226 Difference]: Without dead ends: 121 [2019-12-07 18:22:15,947 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 18:22:15,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-12-07 18:22:15,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 101. [2019-12-07 18:22:15,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-12-07 18:22:15,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-12-07 18:22:15,953 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 30 [2019-12-07 18:22:15,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:15,953 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-12-07 18:22:15,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:22:15,954 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-12-07 18:22:15,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 18:22:15,955 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:15,955 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 18:22:15,955 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 18:22:15,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:15,955 INFO L82 PathProgramCache]: Analyzing trace with hash 526254410, now seen corresponding path program 1 times [2019-12-07 18:22:15,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:15,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450464783] [2019-12-07 18:22:15,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:16,077 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 18:22:16,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450464783] [2019-12-07 18:22:16,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627573494] [2019-12-07 18:22:16,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/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 18:22:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:16,151 INFO L264 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 18:22:16,156 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:22:16,238 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:22:16,247 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:16,247 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 18:22:16,248 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:16,257 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 18:22:16,258 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 18:22:16,258 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-12-07 18:22:16,264 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 18:22:16,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:22:16,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-12-07 18:22:16,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943276724] [2019-12-07 18:22:16,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:22:16,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:16,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:22:16,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:22:16,266 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 12 states. [2019-12-07 18:22:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:16,871 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2019-12-07 18:22:16,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:22:16,872 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-12-07 18:22:16,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:16,872 INFO L225 Difference]: With dead ends: 142 [2019-12-07 18:22:16,873 INFO L226 Difference]: Without dead ends: 142 [2019-12-07 18:22:16,873 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 18:22:16,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-12-07 18:22:16,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 106. [2019-12-07 18:22:16,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 18:22:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2019-12-07 18:22:16,878 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 32 [2019-12-07 18:22:16,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:16,879 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2019-12-07 18:22:16,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:22:16,879 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2019-12-07 18:22:16,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 18:22:16,879 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:16,880 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 18:22:17,080 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:22:17,082 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 18:22:17,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:17,083 INFO L82 PathProgramCache]: Analyzing trace with hash 526254411, now seen corresponding path program 1 times [2019-12-07 18:22:17,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:17,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937687201] [2019-12-07 18:22:17,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:17,328 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 18:22:17,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937687201] [2019-12-07 18:22:17,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741157575] [2019-12-07 18:22:17,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/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 18:22:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:17,409 INFO L264 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 18:22:17,411 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:22:17,416 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 18:22:17,416 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:17,419 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:17,419 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:17,419 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 18:22:17,484 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:17,484 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 18:22:17,485 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:17,496 INFO L614 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-12-07 18:22:17,497 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 18:22:17,497 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-12-07 18:22:17,504 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 18:22:17,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:22:17,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-12-07 18:22:17,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803008119] [2019-12-07 18:22:17,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:22:17,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:17,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:22:17,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:22:17,506 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand 12 states. [2019-12-07 18:22:17,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:17,960 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2019-12-07 18:22:17,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:22:17,960 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-12-07 18:22:17,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:17,961 INFO L225 Difference]: With dead ends: 127 [2019-12-07 18:22:17,961 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 18:22:17,961 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 18:22:17,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 18:22:17,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 106. [2019-12-07 18:22:17,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 18:22:17,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2019-12-07 18:22:17,965 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 32 [2019-12-07 18:22:17,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:17,966 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2019-12-07 18:22:17,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:22:17,966 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2019-12-07 18:22:17,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 18:22:17,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:17,967 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 18:22:18,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:22:18,167 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 18:22:18,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:18,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1075498847, now seen corresponding path program 1 times [2019-12-07 18:22:18,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:18,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718503614] [2019-12-07 18:22:18,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:18,241 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 18:22:18,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718503614] [2019-12-07 18:22:18,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749020609] [2019-12-07 18:22:18,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/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 18:22:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:18,322 INFO L264 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 18:22:18,324 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:22:18,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:22:18,357 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 18:22:18,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:22:18,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-12-07 18:22:18,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305488842] [2019-12-07 18:22:18,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:22:18,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:18,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:22:18,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:22:18,359 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 10 states. [2019-12-07 18:22:18,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:18,633 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2019-12-07 18:22:18,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:22:18,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-12-07 18:22:18,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:18,634 INFO L225 Difference]: With dead ends: 126 [2019-12-07 18:22:18,634 INFO L226 Difference]: Without dead ends: 126 [2019-12-07 18:22:18,635 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 18:22:18,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-12-07 18:22:18,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 106. [2019-12-07 18:22:18,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 18:22:18,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2019-12-07 18:22:18,639 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 34 [2019-12-07 18:22:18,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:18,639 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2019-12-07 18:22:18,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:22:18,639 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2019-12-07 18:22:18,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:22:18,640 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:18,640 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 18:22:18,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:22:18,841 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 18:22:18,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:18,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1014493416, now seen corresponding path program 1 times [2019-12-07 18:22:18,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:18,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758654941] [2019-12-07 18:22:18,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:19,034 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 18:22:19,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758654941] [2019-12-07 18:22:19,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745411951] [2019-12-07 18:22:19,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/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 18:22:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:19,106 INFO L264 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 18:22:19,107 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:22:19,118 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 18:22:19,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:22:19,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 10 [2019-12-07 18:22:19,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752935115] [2019-12-07 18:22:19,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:22:19,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:19,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:22:19,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:22:19,120 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand 11 states. [2019-12-07 18:22:19,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:19,431 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2019-12-07 18:22:19,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:22:19,431 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-12-07 18:22:19,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:19,433 INFO L225 Difference]: With dead ends: 136 [2019-12-07 18:22:19,433 INFO L226 Difference]: Without dead ends: 136 [2019-12-07 18:22:19,433 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 18:22:19,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-12-07 18:22:19,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 109. [2019-12-07 18:22:19,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 18:22:19,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2019-12-07 18:22:19,437 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 35 [2019-12-07 18:22:19,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:19,437 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2019-12-07 18:22:19,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:22:19,437 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2019-12-07 18:22:19,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:22:19,438 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:19,438 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 18:22:19,639 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:22:19,640 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 18:22:19,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:19,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1014493415, now seen corresponding path program 1 times [2019-12-07 18:22:19,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:19,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449547793] [2019-12-07 18:22:19,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:19,710 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 18:22:19,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449547793] [2019-12-07 18:22:19,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015232393] [2019-12-07 18:22:19,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/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 18:22:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:19,789 INFO L264 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:22:19,791 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:22:19,794 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 18:22:19,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:22:19,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 6 [2019-12-07 18:22:19,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995362220] [2019-12-07 18:22:19,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:22:19,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:19,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:22:19,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:22:19,796 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 7 states. [2019-12-07 18:22:20,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:20,010 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2019-12-07 18:22:20,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:22:20,010 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-07 18:22:20,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:20,011 INFO L225 Difference]: With dead ends: 129 [2019-12-07 18:22:20,011 INFO L226 Difference]: Without dead ends: 129 [2019-12-07 18:22:20,012 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 18:22:20,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-12-07 18:22:20,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 109. [2019-12-07 18:22:20,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 18:22:20,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2019-12-07 18:22:20,015 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 35 [2019-12-07 18:22:20,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:20,015 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2019-12-07 18:22:20,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:22:20,016 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2019-12-07 18:22:20,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 18:22:20,016 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:20,016 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 18:22:20,217 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:22:20,218 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 18:22:20,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:20,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1384524796, now seen corresponding path program 1 times [2019-12-07 18:22:20,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:20,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923005727] [2019-12-07 18:22:20,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:20,334 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 18:22:20,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923005727] [2019-12-07 18:22:20,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:20,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:22:20,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517801386] [2019-12-07 18:22:20,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:22:20,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:20,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:22:20,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:22:20,336 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand 9 states. [2019-12-07 18:22:20,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:20,643 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2019-12-07 18:22:20,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:22:20,643 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-07 18:22:20,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:20,644 INFO L225 Difference]: With dead ends: 128 [2019-12-07 18:22:20,644 INFO L226 Difference]: Without dead ends: 128 [2019-12-07 18:22:20,644 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 18:22:20,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-07 18:22:20,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 108. [2019-12-07 18:22:20,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-12-07 18:22:20,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2019-12-07 18:22:20,647 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 36 [2019-12-07 18:22:20,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:20,647 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2019-12-07 18:22:20,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:22:20,647 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2019-12-07 18:22:20,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 18:22:20,648 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:20,648 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 18:22:20,648 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 18:22:20,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:20,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1384524797, now seen corresponding path program 1 times [2019-12-07 18:22:20,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:20,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562986969] [2019-12-07 18:22:20,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:20,748 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 18:22:20,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562986969] [2019-12-07 18:22:20,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:20,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:22:20,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277967877] [2019-12-07 18:22:20,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:22:20,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:20,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:22:20,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:22:20,750 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 10 states. [2019-12-07 18:22:21,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:21,056 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2019-12-07 18:22:21,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:22:21,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-12-07 18:22:21,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:21,057 INFO L225 Difference]: With dead ends: 126 [2019-12-07 18:22:21,057 INFO L226 Difference]: Without dead ends: 126 [2019-12-07 18:22:21,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:22:21,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-12-07 18:22:21,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2019-12-07 18:22:21,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 18:22:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2019-12-07 18:22:21,061 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 36 [2019-12-07 18:22:21,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:21,061 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2019-12-07 18:22:21,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:22:21,061 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2019-12-07 18:22:21,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 18:22:21,062 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:21,062 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 18:22:21,063 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 18:22:21,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:21,063 INFO L82 PathProgramCache]: Analyzing trace with hash -65422212, now seen corresponding path program 1 times [2019-12-07 18:22:21,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:21,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602364986] [2019-12-07 18:22:21,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:21,194 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 18:22:21,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602364986] [2019-12-07 18:22:21,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:21,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 18:22:21,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584792547] [2019-12-07 18:22:21,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 18:22:21,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:21,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 18:22:21,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:22:21,195 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand 14 states. [2019-12-07 18:22:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:21,696 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2019-12-07 18:22:21,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:22:21,696 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2019-12-07 18:22:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:21,697 INFO L225 Difference]: With dead ends: 135 [2019-12-07 18:22:21,698 INFO L226 Difference]: Without dead ends: 135 [2019-12-07 18:22:21,698 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 18:22:21,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-12-07 18:22:21,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 110. [2019-12-07 18:22:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 18:22:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2019-12-07 18:22:21,701 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 45 [2019-12-07 18:22:21,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:21,701 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2019-12-07 18:22:21,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 18:22:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2019-12-07 18:22:21,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 18:22:21,702 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:21,702 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 18:22:21,702 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 18:22:21,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:21,703 INFO L82 PathProgramCache]: Analyzing trace with hash -65422211, now seen corresponding path program 1 times [2019-12-07 18:22:21,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:21,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733811447] [2019-12-07 18:22:21,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:21,769 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 18:22:21,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733811447] [2019-12-07 18:22:21,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:21,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:22:21,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876167498] [2019-12-07 18:22:21,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:22:21,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:21,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:22:21,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:22:21,771 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand 8 states. [2019-12-07 18:22:22,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:22,061 INFO L93 Difference]: Finished difference Result 152 states and 169 transitions. [2019-12-07 18:22:22,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:22:22,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-12-07 18:22:22,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:22,062 INFO L225 Difference]: With dead ends: 152 [2019-12-07 18:22:22,062 INFO L226 Difference]: Without dead ends: 152 [2019-12-07 18:22:22,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:22:22,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-12-07 18:22:22,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 122. [2019-12-07 18:22:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-12-07 18:22:22,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 141 transitions. [2019-12-07 18:22:22,066 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 141 transitions. Word has length 45 [2019-12-07 18:22:22,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:22,066 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 141 transitions. [2019-12-07 18:22:22,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:22:22,066 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2019-12-07 18:22:22,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 18:22:22,066 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:22,066 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 18:22:22,067 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 18:22:22,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:22,067 INFO L82 PathProgramCache]: Analyzing trace with hash -65422156, now seen corresponding path program 1 times [2019-12-07 18:22:22,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:22,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897717488] [2019-12-07 18:22:22,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:22,267 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 18:22:22,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897717488] [2019-12-07 18:22:22,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:22,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 18:22:22,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170894497] [2019-12-07 18:22:22,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 18:22:22,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:22,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:22:22,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:22:22,269 INFO L87 Difference]: Start difference. First operand 122 states and 141 transitions. Second operand 15 states. [2019-12-07 18:22:22,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:22,862 INFO L93 Difference]: Finished difference Result 145 states and 162 transitions. [2019-12-07 18:22:22,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 18:22:22,862 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2019-12-07 18:22:22,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:22,863 INFO L225 Difference]: With dead ends: 145 [2019-12-07 18:22:22,863 INFO L226 Difference]: Without dead ends: 145 [2019-12-07 18:22:22,863 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-12-07 18:22:22,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-12-07 18:22:22,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 122. [2019-12-07 18:22:22,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-12-07 18:22:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2019-12-07 18:22:22,867 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 45 [2019-12-07 18:22:22,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:22,868 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2019-12-07 18:22:22,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 18:22:22,868 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2019-12-07 18:22:22,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 18:22:22,869 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:22,869 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 18:22:22,869 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 18:22:22,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:22,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1582303812, now seen corresponding path program 1 times [2019-12-07 18:22:22,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:22,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210475685] [2019-12-07 18:22:22,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:22,923 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 18:22:22,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210475685] [2019-12-07 18:22:22,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:22,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:22:22,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994065475] [2019-12-07 18:22:22,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:22:22,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:22,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:22:22,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:22:22,924 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 8 states. [2019-12-07 18:22:23,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:23,161 INFO L93 Difference]: Finished difference Result 129 states and 142 transitions. [2019-12-07 18:22:23,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:22:23,161 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-12-07 18:22:23,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:23,162 INFO L225 Difference]: With dead ends: 129 [2019-12-07 18:22:23,162 INFO L226 Difference]: Without dead ends: 129 [2019-12-07 18:22:23,162 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 18:22:23,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-12-07 18:22:23,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 110. [2019-12-07 18:22:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 18:22:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2019-12-07 18:22:23,166 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 47 [2019-12-07 18:22:23,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:23,166 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2019-12-07 18:22:23,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:22:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2019-12-07 18:22:23,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:22:23,167 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:23,167 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 18:22:23,167 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 18:22:23,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:23,167 INFO L82 PathProgramCache]: Analyzing trace with hash 923693868, now seen corresponding path program 1 times [2019-12-07 18:22:23,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:23,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170610626] [2019-12-07 18:22:23,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:23,574 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:22:23,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170610626] [2019-12-07 18:22:23,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509886570] [2019-12-07 18:22:23,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/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 18:22:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:23,656 INFO L264 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 61 conjunts are in the unsatisfiable core [2019-12-07 18:22:23,658 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:22:23,731 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:23,731 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 18:22:23,732 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:23,734 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:23,734 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:23,735 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 18:22:23,779 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 18:22:23,779 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:23,783 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:23,783 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:23,784 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 18:22:23,812 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 18:22:23,813 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:23,817 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:23,817 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 18:22:23,817 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-12-07 18:22:23,891 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:23,891 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 18:22:23,892 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:23,907 INFO L614 ElimStorePlain]: treesize reduction 22, result has 60.0 percent of original size [2019-12-07 18:22:23,908 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 18:22:23,908 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-12-07 18:22:23,983 INFO L343 Elim1Store]: treesize reduction 34, result has 60.0 percent of original size [2019-12-07 18:22:23,983 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 18:22:23,983 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:23,997 INFO L614 ElimStorePlain]: treesize reduction 50, result has 46.8 percent of original size [2019-12-07 18:22:23,998 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 18:22:23,998 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2019-12-07 18:22:24,307 INFO L343 Elim1Store]: treesize reduction 10, result has 75.6 percent of original size [2019-12-07 18:22:24,307 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 18:22:24,308 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:24,311 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:24,311 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 18:22:24,311 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:5 [2019-12-07 18:22:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:24,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:22:24,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 39 [2019-12-07 18:22:24,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255176704] [2019-12-07 18:22:24,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-07 18:22:24,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:24,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-07 18:22:24,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1460, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 18:22:24,321 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand 40 states. [2019-12-07 18:22:27,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:27,109 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2019-12-07 18:22:27,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 18:22:27,109 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 48 [2019-12-07 18:22:27,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:27,110 INFO L225 Difference]: With dead ends: 139 [2019-12-07 18:22:27,110 INFO L226 Difference]: Without dead ends: 139 [2019-12-07 18:22:27,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=244, Invalid=2836, Unknown=0, NotChecked=0, Total=3080 [2019-12-07 18:22:27,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-12-07 18:22:27,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 114. [2019-12-07 18:22:27,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-07 18:22:27,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2019-12-07 18:22:27,114 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 48 [2019-12-07 18:22:27,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:27,114 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2019-12-07 18:22:27,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-07 18:22:27,114 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2019-12-07 18:22:27,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:22:27,114 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:27,114 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 18:22:27,315 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:22:27,316 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 18:22:27,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:27,317 INFO L82 PathProgramCache]: Analyzing trace with hash 923693869, now seen corresponding path program 1 times [2019-12-07 18:22:27,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:27,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287180404] [2019-12-07 18:22:27,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:28,008 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:22:28,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287180404] [2019-12-07 18:22:28,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211799532] [2019-12-07 18:22:28,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/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 18:22:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:28,092 INFO L264 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 83 conjunts are in the unsatisfiable core [2019-12-07 18:22:28,095 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:22:28,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:22:28,387 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 18:22:28,387 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:28,397 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:28,402 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:28,403 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 18:22:28,403 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:28,411 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:28,411 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:28,411 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2019-12-07 18:22:28,512 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 18:22:28,512 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:28,524 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:28,527 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 18:22:28,527 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:28,538 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:28,538 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:28,538 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2019-12-07 18:22:28,609 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 18:22:28,609 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:28,650 INFO L614 ElimStorePlain]: treesize reduction 5, result has 92.2 percent of original size [2019-12-07 18:22:28,654 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 18:22:28,655 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:28,676 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:28,676 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:28,676 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:55 [2019-12-07 18:22:29,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:22:29,035 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:29,035 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 80 treesize of output 123 [2019-12-07 18:22:29,036 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:29,074 INFO L614 ElimStorePlain]: treesize reduction 42, result has 66.9 percent of original size [2019-12-07 18:22:29,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:22:29,077 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 47 treesize of output 40 [2019-12-07 18:22:29,078 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:29,093 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:29,093 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:29,094 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:113, output treesize:69 [2019-12-07 18:22:29,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:22:29,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:22:29,434 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-12-07 18:22:29,435 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:29,436 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 5 case distinctions, treesize of input 105 treesize of output 209 [2019-12-07 18:22:29,440 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:29,526 INFO L614 ElimStorePlain]: treesize reduction 134, result has 52.7 percent of original size [2019-12-07 18:22:29,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:22:29,531 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:29,531 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 112 [2019-12-07 18:22:29,532 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:29,549 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:29,549 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:29,550 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:141, output treesize:145 [2019-12-07 18:22:30,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:22:30,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:22:30,110 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:30,111 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 120 treesize of output 127 [2019-12-07 18:22:30,111 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:30,123 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:30,131 INFO L343 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2019-12-07 18:22:30,131 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 70 treesize of output 42 [2019-12-07 18:22:30,132 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:30,137 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:30,138 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 18:22:30,138 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:159, output treesize:23 [2019-12-07 18:22:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:30,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:22:30,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2019-12-07 18:22:30,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028718388] [2019-12-07 18:22:30,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-12-07 18:22:30,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:30,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-12-07 18:22:30,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=2140, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 18:22:30,303 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand 48 states. [2019-12-07 18:22:31,451 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 20 [2019-12-07 18:22:32,078 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2019-12-07 18:22:32,566 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 40 [2019-12-07 18:22:33,245 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 78 [2019-12-07 18:22:35,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:35,412 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2019-12-07 18:22:35,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 18:22:35,412 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-12-07 18:22:35,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:35,413 INFO L225 Difference]: With dead ends: 140 [2019-12-07 18:22:35,413 INFO L226 Difference]: Without dead ends: 140 [2019-12-07 18:22:35,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=286, Invalid=4004, Unknown=0, NotChecked=0, Total=4290 [2019-12-07 18:22:35,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-12-07 18:22:35,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 114. [2019-12-07 18:22:35,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-07 18:22:35,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2019-12-07 18:22:35,417 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 48 [2019-12-07 18:22:35,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:35,417 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2019-12-07 18:22:35,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-12-07 18:22:35,417 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2019-12-07 18:22:35,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 18:22:35,417 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:35,417 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:35,618 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:22:35,618 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 18:22:35,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:35,618 INFO L82 PathProgramCache]: Analyzing trace with hash -89784708, now seen corresponding path program 2 times [2019-12-07 18:22:35,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:35,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875964603] [2019-12-07 18:22:35,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:35,684 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 18:22:35,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875964603] [2019-12-07 18:22:35,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:35,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:22:35,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760188690] [2019-12-07 18:22:35,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:22:35,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:35,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:22:35,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:22:35,685 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand 9 states. [2019-12-07 18:22:35,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:35,950 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2019-12-07 18:22:35,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:22:35,951 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-07 18:22:35,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:35,951 INFO L225 Difference]: With dead ends: 125 [2019-12-07 18:22:35,951 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 18:22:35,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:22:35,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 18:22:35,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 106. [2019-12-07 18:22:35,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 18:22:35,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2019-12-07 18:22:35,954 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 51 [2019-12-07 18:22:35,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:35,954 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2019-12-07 18:22:35,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:22:35,954 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2019-12-07 18:22:35,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 18:22:35,955 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:35,955 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 18:22:35,955 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 18:22:35,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:35,955 INFO L82 PathProgramCache]: Analyzing trace with hash -980873952, now seen corresponding path program 1 times [2019-12-07 18:22:35,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:35,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652307453] [2019-12-07 18:22:35,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:36,085 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 18:22:36,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652307453] [2019-12-07 18:22:36,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:36,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 18:22:36,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824829564] [2019-12-07 18:22:36,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 18:22:36,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:36,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:22:36,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:22:36,086 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand 15 states. [2019-12-07 18:22:37,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:37,052 INFO L93 Difference]: Finished difference Result 133 states and 140 transitions. [2019-12-07 18:22:37,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 18:22:37,052 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2019-12-07 18:22:37,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:37,053 INFO L225 Difference]: With dead ends: 133 [2019-12-07 18:22:37,053 INFO L226 Difference]: Without dead ends: 133 [2019-12-07 18:22:37,053 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-12-07 18:22:37,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-12-07 18:22:37,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 109. [2019-12-07 18:22:37,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 18:22:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-12-07 18:22:37,056 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 58 [2019-12-07 18:22:37,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:37,056 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-12-07 18:22:37,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 18:22:37,056 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-12-07 18:22:37,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 18:22:37,057 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:37,057 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 18:22:37,057 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 18:22:37,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:37,057 INFO L82 PathProgramCache]: Analyzing trace with hash -980873951, now seen corresponding path program 1 times [2019-12-07 18:22:37,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:37,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544411313] [2019-12-07 18:22:37,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:37,164 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 18:22:37,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544411313] [2019-12-07 18:22:37,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073587859] [2019-12-07 18:22:37,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/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 18:22:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:37,250 INFO L264 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:22:37,252 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:22:37,275 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 18:22:37,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:22:37,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 14 [2019-12-07 18:22:37,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861850315] [2019-12-07 18:22:37,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 18:22:37,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:37,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 18:22:37,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:22:37,276 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 14 states. [2019-12-07 18:22:37,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:37,615 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2019-12-07 18:22:37,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:22:37,615 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2019-12-07 18:22:37,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:37,616 INFO L225 Difference]: With dead ends: 137 [2019-12-07 18:22:37,616 INFO L226 Difference]: Without dead ends: 137 [2019-12-07 18:22:37,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:22:37,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-12-07 18:22:37,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 116. [2019-12-07 18:22:37,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-12-07 18:22:37,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2019-12-07 18:22:37,619 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 58 [2019-12-07 18:22:37,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:37,619 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2019-12-07 18:22:37,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 18:22:37,619 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2019-12-07 18:22:37,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 18:22:37,619 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:37,620 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 18:22:37,820 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:22:37,821 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 18:22:37,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:37,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1768494232, now seen corresponding path program 1 times [2019-12-07 18:22:37,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:37,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618124524] [2019-12-07 18:22:37,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:37,933 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 18:22:37,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618124524] [2019-12-07 18:22:37,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879600305] [2019-12-07 18:22:37,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/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 18:22:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:38,013 INFO L264 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 18:22:38,015 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:22:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 18:22:38,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:22:38,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 10 [2019-12-07 18:22:38,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732299264] [2019-12-07 18:22:38,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:22:38,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:38,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:22:38,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:22:38,020 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand 7 states. [2019-12-07 18:22:38,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:38,067 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2019-12-07 18:22:38,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:22:38,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-07 18:22:38,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:38,068 INFO L225 Difference]: With dead ends: 112 [2019-12-07 18:22:38,068 INFO L226 Difference]: Without dead ends: 112 [2019-12-07 18:22:38,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:22:38,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-12-07 18:22:38,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-12-07 18:22:38,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 18:22:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2019-12-07 18:22:38,071 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 59 [2019-12-07 18:22:38,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:38,071 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2019-12-07 18:22:38,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:22:38,071 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2019-12-07 18:22:38,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:22:38,072 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:38,072 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] [2019-12-07 18:22:38,272 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:22:38,273 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 18:22:38,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:38,274 INFO L82 PathProgramCache]: Analyzing trace with hash 881589941, now seen corresponding path program 2 times [2019-12-07 18:22:38,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:38,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612688557] [2019-12-07 18:22:38,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:38,383 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 18:22:38,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612688557] [2019-12-07 18:22:38,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:38,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:22:38,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522842434] [2019-12-07 18:22:38,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:22:38,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:38,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:22:38,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:22:38,384 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 9 states. [2019-12-07 18:22:38,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:38,776 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2019-12-07 18:22:38,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:22:38,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-07 18:22:38,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:38,778 INFO L225 Difference]: With dead ends: 145 [2019-12-07 18:22:38,778 INFO L226 Difference]: Without dead ends: 145 [2019-12-07 18:22:38,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:22:38,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-12-07 18:22:38,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 120. [2019-12-07 18:22:38,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-12-07 18:22:38,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2019-12-07 18:22:38,782 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 66 [2019-12-07 18:22:38,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:38,783 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2019-12-07 18:22:38,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:22:38,783 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2019-12-07 18:22:38,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:22:38,783 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:38,783 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] [2019-12-07 18:22:38,784 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 18:22:38,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:38,784 INFO L82 PathProgramCache]: Analyzing trace with hash 881589996, now seen corresponding path program 1 times [2019-12-07 18:22:38,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:38,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757825476] [2019-12-07 18:22:38,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:39,003 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 18:22:39,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757825476] [2019-12-07 18:22:39,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:39,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 18:22:39,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900040436] [2019-12-07 18:22:39,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 18:22:39,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:39,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 18:22:39,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:22:39,004 INFO L87 Difference]: Start difference. First operand 120 states and 135 transitions. Second operand 16 states. [2019-12-07 18:22:39,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:39,781 INFO L93 Difference]: Finished difference Result 144 states and 157 transitions. [2019-12-07 18:22:39,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 18:22:39,782 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-07 18:22:39,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:39,784 INFO L225 Difference]: With dead ends: 144 [2019-12-07 18:22:39,784 INFO L226 Difference]: Without dead ends: 144 [2019-12-07 18:22:39,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2019-12-07 18:22:39,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-12-07 18:22:39,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 120. [2019-12-07 18:22:39,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-12-07 18:22:39,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-12-07 18:22:39,791 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 66 [2019-12-07 18:22:39,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:39,792 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-12-07 18:22:39,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 18:22:39,792 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-12-07 18:22:39,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 18:22:39,793 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:39,793 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 18:22:39,794 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 18:22:39,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:39,794 INFO L82 PathProgramCache]: Analyzing trace with hash -277425520, now seen corresponding path program 1 times [2019-12-07 18:22:39,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:39,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065795937] [2019-12-07 18:22:39,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:40,485 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 18:22:40,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065795937] [2019-12-07 18:22:40,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890961461] [2019-12-07 18:22:40,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/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 18:22:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:40,563 INFO L264 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 81 conjunts are in the unsatisfiable core [2019-12-07 18:22:40,565 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:22:40,656 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:40,656 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 18:22:40,656 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:40,659 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:40,659 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:40,660 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 18:22:40,722 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 18:22:40,722 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:40,727 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:40,727 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:22:40,727 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 18:22:40,761 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 18:22:40,761 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:40,766 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:40,766 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 18:22:40,766 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-12-07 18:22:40,858 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:40,858 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 18:22:40,859 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:40,873 INFO L614 ElimStorePlain]: treesize reduction 22, result has 56.0 percent of original size [2019-12-07 18:22:40,873 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 18:22:40,873 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-12-07 18:22:40,952 INFO L343 Elim1Store]: treesize reduction 34, result has 60.0 percent of original size [2019-12-07 18:22:40,952 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 18:22:40,953 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:40,965 INFO L614 ElimStorePlain]: treesize reduction 58, result has 40.2 percent of original size [2019-12-07 18:22:40,966 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 18:22:40,966 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:39 [2019-12-07 18:22:42,701 WARN L192 SmtUtils]: Spent 1.42 s on a formula simplification that was a NOOP. DAG size: 21 [2019-12-07 18:22:42,801 INFO L343 Elim1Store]: treesize reduction 10, result has 94.4 percent of original size [2019-12-07 18:22:42,801 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 18:22:42,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:22:42,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:22:42,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:22:42,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:22:42,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:22:42,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:22:42,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:22:42,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:22:42,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:22:42,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:22:42,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:22:42,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:22:42,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:22:42,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:22:42,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:22:42,808 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 9 xjuncts. [2019-12-07 18:22:42,912 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 31 [2019-12-07 18:22:42,912 INFO L614 ElimStorePlain]: treesize reduction 1900, result has 6.2 percent of original size [2019-12-07 18:22:42,913 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 18:22:42,913 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:79, output treesize:106 [2019-12-07 18:22:43,021 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-12-07 18:22:43,021 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 35 treesize of output 13 [2019-12-07 18:22:43,022 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 18:22:43,027 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:43,028 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 18:22:43,028 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:9 [2019-12-07 18:22:56,562 WARN L192 SmtUtils]: Spent 650.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-12-07 18:22:56,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:22:56,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:22:56,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:22:56,570 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:56,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 29 [2019-12-07 18:22:56,571 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:56,577 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:56,577 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 18:22:56,577 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:36 [2019-12-07 18:22:56,733 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-12-07 18:22:56,733 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 18:22:56,733 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:22:56,736 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:22:56,736 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 18:22:56,736 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:5 [2019-12-07 18:22:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:22:56,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:22:56,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 53 [2019-12-07 18:22:56,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951475311] [2019-12-07 18:22:56,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-12-07 18:22:56,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:56,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-12-07 18:22:56,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=2700, Unknown=17, NotChecked=0, Total=2862 [2019-12-07 18:22:56,750 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 54 states. [2019-12-07 18:23:16,086 WARN L192 SmtUtils]: Spent 680.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-12-07 18:23:20,160 WARN L192 SmtUtils]: Spent 879.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 18:23:26,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:26,410 INFO L93 Difference]: Finished difference Result 156 states and 172 transitions. [2019-12-07 18:23:26,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 18:23:26,410 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 69 [2019-12-07 18:23:26,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:26,411 INFO L225 Difference]: With dead ends: 156 [2019-12-07 18:23:26,411 INFO L226 Difference]: Without dead ends: 156 [2019-12-07 18:23:26,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=459, Invalid=5844, Unknown=17, NotChecked=0, Total=6320 [2019-12-07 18:23:26,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-12-07 18:23:26,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2019-12-07 18:23:26,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-12-07 18:23:26,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 146 transitions. [2019-12-07 18:23:26,415 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 146 transitions. Word has length 69 [2019-12-07 18:23:26,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:26,415 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 146 transitions. [2019-12-07 18:23:26,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-12-07 18:23:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 146 transitions. [2019-12-07 18:23:26,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 18:23:26,416 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:26,416 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 18:23:26,616 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:23:26,617 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 18:23:26,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:26,618 INFO L82 PathProgramCache]: Analyzing trace with hash -277425519, now seen corresponding path program 1 times [2019-12-07 18:23:26,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:26,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101572617] [2019-12-07 18:23:26,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:27,659 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:23:27,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101572617] [2019-12-07 18:23:27,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837303271] [2019-12-07 18:23:27,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/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 18:23:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:27,756 INFO L264 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 96 conjunts are in the unsatisfiable core [2019-12-07 18:23:27,758 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:23:27,967 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:27,967 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 18:23:27,968 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:27,971 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:27,971 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:23:27,971 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 18:23:28,044 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 18:23:28,044 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:28,049 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:28,049 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:23:28,049 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 18:23:28,093 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 18:23:28,093 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:28,098 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:28,098 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 18:23:28,098 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-12-07 18:23:28,212 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:28,213 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 18:23:28,213 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:28,229 INFO L614 ElimStorePlain]: treesize reduction 22, result has 56.0 percent of original size [2019-12-07 18:23:28,229 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 18:23:28,229 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-12-07 18:23:30,290 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2019-12-07 18:23:30,292 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_35|], 12=[|v_#memory_$Pointer$.base_48|]} [2019-12-07 18:23:30,297 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 18:23:30,297 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:30,307 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:30,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:23:30,344 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:30,344 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 50 treesize of output 144 [2019-12-07 18:23:30,345 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:30,365 INFO L614 ElimStorePlain]: treesize reduction 94, result has 36.9 percent of original size [2019-12-07 18:23:30,365 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 18:23:30,366 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:52 [2019-12-07 18:23:32,434 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-12-07 18:23:34,502 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-12-07 18:23:36,574 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-12-07 18:23:38,650 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-12-07 18:23:38,907 INFO L430 ElimStorePlain]: Different costs {6=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_33|], 20=[|v_#memory_$Pointer$.base_BEFORE_CALL_8|]} [2019-12-07 18:23:38,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:23:38,910 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 120 treesize of output 101 [2019-12-07 18:23:38,910 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:38,923 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:38,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:23:39,005 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:39,005 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 5 new quantified variables, introduced 9 case distinctions, treesize of input 106 treesize of output 371 [2019-12-07 18:23:39,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:39,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:39,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:39,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:39,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:39,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:39,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:39,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:39,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:39,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:39,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:39,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:39,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:39,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:39,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:39,013 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-12-07 18:23:39,128 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2019-12-07 18:23:39,128 INFO L614 ElimStorePlain]: treesize reduction 1670, result has 11.7 percent of original size [2019-12-07 18:23:39,129 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 18:23:39,129 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:154, output treesize:167 [2019-12-07 18:23:39,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:39,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:39,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:23:39,233 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_BEFORE_CALL_4|], 6=[|v_#memory_$Pointer$.base_BEFORE_CALL_9|]} [2019-12-07 18:23:39,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:23:39,238 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 42 treesize of output 24 [2019-12-07 18:23:39,239 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:23:39,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:23:39,243 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 46 treesize of output 32 [2019-12-07 18:23:39,243 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 18:23:39,263 INFO L614 ElimStorePlain]: treesize reduction 55, result has 42.7 percent of original size [2019-12-07 18:23:39,265 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-12-07 18:23:39,265 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 35 treesize of output 13 [2019-12-07 18:23:39,266 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:23:39,271 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:23:39,272 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 18:23:39,272 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:147, output treesize:12 [2019-12-07 18:24:26,908 WARN L192 SmtUtils]: Spent 4.38 s on a formula simplification that was a NOOP. DAG size: 31 [2019-12-07 18:24:26,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:24:26,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:24:26,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:24:26,914 INFO L430 ElimStorePlain]: Different costs {6=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_34|], 12=[|v_#memory_$Pointer$.base_BEFORE_CALL_10|]} [2019-12-07 18:24:26,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:24:26,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:24:26,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:24:26,930 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 48 [2019-12-07 18:24:26,931 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:26,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:24:26,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:24:26,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:24:26,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 40 [2019-12-07 18:24:26,940 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:26,978 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:26,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:24:26,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:24:26,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:24:26,993 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 37 [2019-12-07 18:24:26,993 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:26,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:24:26,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:24:26,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:24:27,036 INFO L343 Elim1Store]: treesize reduction 36, result has 65.4 percent of original size [2019-12-07 18:24:27,036 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 79 treesize of output 108 [2019-12-07 18:24:27,036 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:27,091 INFO L614 ElimStorePlain]: treesize reduction 22, result has 87.4 percent of original size [2019-12-07 18:24:27,091 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 2 xjuncts. [2019-12-07 18:24:27,091 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:227, output treesize:147 [2019-12-07 18:24:27,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:24:27,442 INFO L430 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-12-07 18:24:27,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:24:27,448 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 53 treesize of output 35 [2019-12-07 18:24:27,448 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 18:24:27,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:24:27,452 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 49 treesize of output 27 [2019-12-07 18:24:27,452 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:27,472 INFO L614 ElimStorePlain]: treesize reduction 63, result has 43.8 percent of original size [2019-12-07 18:24:27,474 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-12-07 18:24:27,474 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 18:24:27,474 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:24:27,478 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:24:27,478 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 18:24:27,478 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:163, output treesize:13 [2019-12-07 18:24:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:24:27,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:24:27,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31] total 62 [2019-12-07 18:24:27,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614013417] [2019-12-07 18:24:27,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-12-07 18:24:27,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:27,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-12-07 18:24:27,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=3700, Unknown=25, NotChecked=0, Total=3906 [2019-12-07 18:24:27,616 INFO L87 Difference]: Start difference. First operand 128 states and 146 transitions. Second operand 63 states. [2019-12-07 18:24:35,131 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-12-07 18:24:39,312 WARN L192 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-12-07 18:24:47,535 WARN L192 SmtUtils]: Spent 8.11 s on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-12-07 18:24:49,622 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2019-12-07 18:24:53,726 WARN L192 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 49 DAG size of output: 31 [2019-12-07 18:24:58,049 WARN L192 SmtUtils]: Spent 3.44 s on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 18:25:00,490 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-12-07 18:25:00,739 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-12-07 18:25:01,676 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-12-07 18:25:05,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:05,164 INFO L93 Difference]: Finished difference Result 159 states and 174 transitions. [2019-12-07 18:25:05,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 18:25:05,165 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 69 [2019-12-07 18:25:05,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:05,166 INFO L225 Difference]: With dead ends: 159 [2019-12-07 18:25:05,166 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 18:25:05,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 88.3s TimeCoverageRelationStatistics Valid=552, Invalid=7979, Unknown=25, NotChecked=0, Total=8556 [2019-12-07 18:25:05,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 18:25:05,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 127. [2019-12-07 18:25:05,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-12-07 18:25:05,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 141 transitions. [2019-12-07 18:25:05,174 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 141 transitions. Word has length 69 [2019-12-07 18:25:05,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:05,174 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 141 transitions. [2019-12-07 18:25:05,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-12-07 18:25:05,174 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2019-12-07 18:25:05,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 18:25:05,175 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:05,175 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 18:25:05,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:05,376 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 18:25:05,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:05,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1264901836, now seen corresponding path program 2 times [2019-12-07 18:25:05,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:05,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593202023] [2019-12-07 18:25:05,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:05,476 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 18:25:05,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593202023] [2019-12-07 18:25:05,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:05,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:25:05,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749664651] [2019-12-07 18:25:05,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:25:05,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:05,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:25:05,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:25:05,477 INFO L87 Difference]: Start difference. First operand 127 states and 141 transitions. Second operand 10 states. [2019-12-07 18:25:05,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:05,786 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2019-12-07 18:25:05,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:25:05,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-12-07 18:25:05,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:05,787 INFO L225 Difference]: With dead ends: 132 [2019-12-07 18:25:05,787 INFO L226 Difference]: Without dead ends: 132 [2019-12-07 18:25:05,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 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 18:25:05,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-12-07 18:25:05,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 113. [2019-12-07 18:25:05,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 18:25:05,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2019-12-07 18:25:05,790 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 72 [2019-12-07 18:25:05,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:05,790 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2019-12-07 18:25:05,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:25:05,790 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2019-12-07 18:25:05,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 18:25:05,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:05,791 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, 1, 1, 1] [2019-12-07 18:25:05,791 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 18:25:05,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:05,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1589009, now seen corresponding path program 1 times [2019-12-07 18:25:05,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:05,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327225302] [2019-12-07 18:25:05,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:07,139 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:25:07,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327225302] [2019-12-07 18:25:07,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259212398] [2019-12-07 18:25:07,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/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 18:25:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:07,218 INFO L264 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 118 conjunts are in the unsatisfiable core [2019-12-07 18:25:07,220 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:08,092 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:08,093 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 18:25:08,093 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:08,102 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:08,103 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:25:08,103 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 18:25:08,358 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 18:25:08,359 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:08,371 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:08,372 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:25:08,372 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 18:25:08,617 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 18:25:08,618 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:08,637 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:08,638 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 18:25:08,638 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-12-07 18:25:08,968 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:08,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 52 [2019-12-07 18:25:08,969 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:08,982 INFO L614 ElimStorePlain]: treesize reduction 22, result has 56.0 percent of original size [2019-12-07 18:25:08,982 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 18:25:08,982 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-12-07 18:25:11,047 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2019-12-07 18:25:11,049 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_38|], 12=[|v_#memory_$Pointer$.base_54|]} [2019-12-07 18:25:11,052 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 18:25:11,052 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:11,061 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:11,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:11,100 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:11,100 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 50 treesize of output 144 [2019-12-07 18:25:11,101 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:11,122 INFO L614 ElimStorePlain]: treesize reduction 110, result has 35.7 percent of original size [2019-12-07 18:25:11,122 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 18:25:11,122 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:58 [2019-12-07 18:25:13,203 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-12-07 18:25:15,278 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-12-07 18:25:17,359 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2019-12-07 18:25:19,465 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 30 [2019-12-07 18:25:21,567 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2019-12-07 18:25:21,687 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 18:25:21,688 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:21,695 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:21,695 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:25:21,695 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:104, output treesize:96 [2019-12-07 18:25:21,798 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_BEFORE_CALL_7|], 20=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_38|]} [2019-12-07 18:25:21,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:21,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:21,801 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 119 treesize of output 104 [2019-12-07 18:25:21,802 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:21,815 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:22,012 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-12-07 18:25:22,013 INFO L343 Elim1Store]: treesize reduction 10, result has 97.1 percent of original size [2019-12-07 18:25:22,013 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 118 treesize of output 396 [2019-12-07 18:25:22,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:22,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:22,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:22,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:22,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:22,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:22,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:22,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:22,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:22,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:22,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:22,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:22,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:22,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:22,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:22,020 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-12-07 18:25:22,181 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-12-07 18:25:22,181 INFO L614 ElimStorePlain]: treesize reduction 1616, result has 19.6 percent of original size [2019-12-07 18:25:22,182 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:25:22,182 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:160, output treesize:371 [2019-12-07 18:25:32,409 WARN L192 SmtUtils]: Spent 10.08 s on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-12-07 18:25:33,990 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~data Int) (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_int)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_int)| |c_dll_circular_update_at_#in~head.base|) .cse0 dll_circular_update_at_~data)) |c_#memory_int|) (= (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 18:25:33,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:33,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:33,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:33,996 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_int_BEFORE_CALL_2|], 6=[|v_#memory_$Pointer$.offset_BEFORE_CALL_9|], 12=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_39|]} [2019-12-07 18:25:34,010 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 37 treesize of output 36 [2019-12-07 18:25:34,010 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:34,020 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 37 treesize of output 36 [2019-12-07 18:25:34,020 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:34,073 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:34,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:34,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:34,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:34,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2019-12-07 18:25:34,090 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:34,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:34,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:34,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:34,099 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 41 [2019-12-07 18:25:34,100 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:34,141 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:25:34,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:34,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:34,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:34,156 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 41 [2019-12-07 18:25:34,156 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:34,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:34,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:34,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:25:34,197 INFO L343 Elim1Store]: treesize reduction 36, result has 65.4 percent of original size [2019-12-07 18:25:34,197 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 85 treesize of output 114 [2019-12-07 18:25:34,197 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 18:25:34,255 INFO L614 ElimStorePlain]: treesize reduction 22, result has 87.8 percent of original size [2019-12-07 18:25:34,256 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 18:25:34,256 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:243, output treesize:135 [2019-12-07 18:25:34,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:25:34,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:26:50,709 WARN L192 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 18:26:59,239 WARN L192 SmtUtils]: Spent 8.40 s on a formula simplification that was a NOOP. DAG size: 55 [2019-12-07 18:26:59,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:14,028 WARN L192 SmtUtils]: Spent 12.53 s on a formula simplification that was a NOOP. DAG size: 59 [2019-12-07 18:27:26,763 WARN L192 SmtUtils]: Spent 12.49 s on a formula simplification that was a NOOP. DAG size: 59 [2019-12-07 18:27:26,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:36,302 WARN L192 SmtUtils]: Spent 9.35 s on a formula simplification that was a NOOP. DAG size: 60 [2019-12-07 18:27:46,928 WARN L192 SmtUtils]: Spent 10.46 s on a formula simplification that was a NOOP. DAG size: 60 [2019-12-07 18:27:46,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:46,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:46,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:46,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:46,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:46,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:46,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:46,976 INFO L430 ElimStorePlain]: Different costs {12=[|#memory_int|], 30=[|#memory_$Pointer$.offset|], 56=[|#memory_$Pointer$.base|]} [2019-12-07 18:27:46,987 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:27:46,996 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:27:46,997 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 56 treesize of output 46 [2019-12-07 18:27:46,997 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:27:47,005 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:27:47,012 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:27:47,012 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 56 treesize of output 46 [2019-12-07 18:27:47,013 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:27:47,020 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:27:47,027 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:27:47,027 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 56 treesize of output 46 [2019-12-07 18:27:47,027 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:27:47,038 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:27:47,039 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 56 treesize of output 46 [2019-12-07 18:27:47,039 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 18:27:47,179 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-12-07 18:27:47,179 INFO L614 ElimStorePlain]: treesize reduction 36, result has 90.6 percent of original size [2019-12-07 18:27:47,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:27:47,200 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:27:47,200 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 49 [2019-12-07 18:27:47,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,203 INFO L534 ElimStorePlain]: Start of recursive call 6: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2019-12-07 18:27:47,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:27:47,227 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:27:47,227 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 49 [2019-12-07 18:27:47,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,230 INFO L534 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:27:47,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:27:47,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:27:47,268 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:27:47,269 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 31 treesize of output 67 [2019-12-07 18:27:47,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,272 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2019-12-07 18:27:47,287 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:27:47,287 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 39 treesize of output 43 [2019-12-07 18:27:47,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,289 INFO L534 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:27:47,488 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 85 [2019-12-07 18:27:47,488 INFO L614 ElimStorePlain]: treesize reduction 319, result has 51.7 percent of original size [2019-12-07 18:27:47,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:27:47,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:27:47,601 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:27:47,601 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 73 treesize of output 199 [2019-12-07 18:27:47,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:47,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:47,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:47,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:47,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:47,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:47,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:47,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:47,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:47,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:27:47,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,623 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-07 18:27:47,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:27:47,667 INFO L343 Elim1Store]: treesize reduction 10, result has 85.1 percent of original size [2019-12-07 18:27:47,668 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 71 [2019-12-07 18:27:47,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:27:47,669 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-07 18:27:47,671 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 18:27:47,671 INFO L534 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-12-07 18:27:47,681 INFO L614 ElimStorePlain]: treesize reduction 24, result has 22.6 percent of original size [2019-12-07 18:27:47,681 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:27:47,681 INFO L239 ElimStorePlain]: Needed 12 recursive calls to eliminate 9 variables, input treesize:557, output treesize:7 [2019-12-07 18:27:47,778 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2019-12-07 18:27:47,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:27:47,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 73 [2019-12-07 18:27:47,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976214642] [2019-12-07 18:27:47,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-12-07 18:27:47,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:47,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-12-07 18:27:47,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=4882, Unknown=38, NotChecked=140, Total=5256 [2019-12-07 18:27:47,780 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 73 states. [2019-12-07 18:28:41,731 WARN L192 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-12-07 18:28:50,198 WARN L192 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-12-07 18:29:02,786 WARN L192 SmtUtils]: Spent 8.11 s on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-12-07 18:29:13,529 WARN L192 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 18:29:21,870 WARN L192 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2019-12-07 18:29:30,216 WARN L192 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-12-07 18:30:02,633 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-07 18:30:06,988 WARN L192 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2019-12-07 18:30:21,214 WARN L192 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 67 DAG size of output: 41 [2019-12-07 18:30:28,073 WARN L192 SmtUtils]: Spent 1.45 s on a formula simplification that was a NOOP. DAG size: 74 [2019-12-07 18:30:42,659 WARN L192 SmtUtils]: Spent 13.49 s on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-07 18:30:50,235 WARN L192 SmtUtils]: Spent 6.57 s on a formula simplification that was a NOOP. DAG size: 78 [2019-12-07 18:31:12,534 WARN L192 SmtUtils]: Spent 21.15 s on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2019-12-07 18:31:26,399 WARN L192 SmtUtils]: Spent 12.73 s on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-12-07 18:31:38,616 WARN L192 SmtUtils]: Spent 392.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 18:31:38,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:31:38,955 INFO L93 Difference]: Finished difference Result 136 states and 142 transitions. [2019-12-07 18:31:38,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-07 18:31:38,956 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 75 [2019-12-07 18:31:38,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:31:38,957 INFO L225 Difference]: With dead ends: 136 [2019-12-07 18:31:38,957 INFO L226 Difference]: Without dead ends: 136 [2019-12-07 18:31:38,961 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 108 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2047 ImplicationChecksByTransitivity, 318.8s TimeCoverageRelationStatistics Valid=577, Invalid=11123, Unknown=76, NotChecked=214, Total=11990 [2019-12-07 18:31:38,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-12-07 18:31:38,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 113. [2019-12-07 18:31:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 18:31:38,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2019-12-07 18:31:38,964 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 75 [2019-12-07 18:31:38,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:31:38,965 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2019-12-07 18:31:38,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-12-07 18:31:38,965 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2019-12-07 18:31:38,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 18:31:38,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:31:38,966 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 18:31:39,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:31:39,168 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 18:31:39,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:31:39,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1829730043, now seen corresponding path program 1 times [2019-12-07 18:31:39,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:31:39,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730473362] [2019-12-07 18:31:39,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:31:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 18:31:39,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730473362] [2019-12-07 18:31:39,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48780350] [2019-12-07 18:31:39,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/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 18:31:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:39,843 INFO L264 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 18:31:39,844 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:31:39,969 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 18:31:39,969 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:31:39,970 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:31:39,971 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:31:39,971 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:31:40,508 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:31:40,509 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 74 treesize of output 56 [2019-12-07 18:31:40,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:31:40,510 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:31:40,525 INFO L614 ElimStorePlain]: treesize reduction 32, result has 46.7 percent of original size [2019-12-07 18:31:40,525 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 18:31:40,525 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:28 [2019-12-07 18:31:40,587 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 18:31:40,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:31:40,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 17] total 41 [2019-12-07 18:31:40,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400061927] [2019-12-07 18:31:40,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-07 18:31:40,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:31:40,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-07 18:31:40,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1526, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 18:31:40,588 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 41 states. [2019-12-07 18:31:42,523 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-12-07 18:31:42,918 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-12-07 18:31:44,574 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2019-12-07 18:31:45,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:31:45,802 INFO L93 Difference]: Finished difference Result 145 states and 151 transitions. [2019-12-07 18:31:45,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 18:31:45,802 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 86 [2019-12-07 18:31:45,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:31:45,803 INFO L225 Difference]: With dead ends: 145 [2019-12-07 18:31:45,803 INFO L226 Difference]: Without dead ends: 145 [2019-12-07 18:31:45,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=365, Invalid=3667, Unknown=0, NotChecked=0, Total=4032 [2019-12-07 18:31:45,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-12-07 18:31:45,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 119. [2019-12-07 18:31:45,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-12-07 18:31:45,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2019-12-07 18:31:45,807 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 86 [2019-12-07 18:31:45,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:31:45,807 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2019-12-07 18:31:45,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-07 18:31:45,808 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2019-12-07 18:31:45,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 18:31:45,808 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:31:45,808 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] [2019-12-07 18:31:46,008 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:31:46,009 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 18:31:46,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:31:46,010 INFO L82 PathProgramCache]: Analyzing trace with hash -656684405, now seen corresponding path program 2 times [2019-12-07 18:31:46,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:31:46,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816014233] [2019-12-07 18:31:46,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:31:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:46,156 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-07 18:31:46,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816014233] [2019-12-07 18:31:46,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329850799] [2019-12-07 18:31:46,157 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/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 18:31:46,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:31:46,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:31:46,278 INFO L264 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 18:31:46,279 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:31:46,294 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-07 18:31:46,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:31:46,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 12 [2019-12-07 18:31:46,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796997848] [2019-12-07 18:31:46,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:31:46,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:31:46,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:31:46,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:31:46,296 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand 12 states. [2019-12-07 18:31:46,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:31:46,669 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2019-12-07 18:31:46,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:31:46,669 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2019-12-07 18:31:46,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:31:46,670 INFO L225 Difference]: With dead ends: 134 [2019-12-07 18:31:46,670 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 18:31:46,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:31:46,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 18:31:46,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 108. [2019-12-07 18:31:46,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-12-07 18:31:46,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2019-12-07 18:31:46,673 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 89 [2019-12-07 18:31:46,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:31:46,673 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2019-12-07 18:31:46,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:31:46,673 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2019-12-07 18:31:46,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 18:31:46,674 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:31:46,674 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 18:31:46,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:31:46,875 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 18:31:46,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:31:46,876 INFO L82 PathProgramCache]: Analyzing trace with hash -743442694, now seen corresponding path program 1 times [2019-12-07 18:31:46,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:31:46,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377050322] [2019-12-07 18:31:46,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:31:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:47,058 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 18:31:47,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377050322] [2019-12-07 18:31:47,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:31:47,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 18:31:47,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590868937] [2019-12-07 18:31:47,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 18:31:47,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:31:47,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:31:47,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:31:47,059 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 15 states. [2019-12-07 18:31:47,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:31:47,852 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2019-12-07 18:31:47,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 18:31:47,852 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 91 [2019-12-07 18:31:47,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:31:47,853 INFO L225 Difference]: With dead ends: 128 [2019-12-07 18:31:47,853 INFO L226 Difference]: Without dead ends: 128 [2019-12-07 18:31:47,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-12-07 18:31:47,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-07 18:31:47,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 111. [2019-12-07 18:31:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 18:31:47,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2019-12-07 18:31:47,855 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 91 [2019-12-07 18:31:47,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:31:47,855 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2019-12-07 18:31:47,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 18:31:47,856 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2019-12-07 18:31:47,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 18:31:47,856 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:31:47,856 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 18:31:47,856 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 18:31:47,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:31:47,856 INFO L82 PathProgramCache]: Analyzing trace with hash -743442693, now seen corresponding path program 1 times [2019-12-07 18:31:47,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:31:47,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211112587] [2019-12-07 18:31:47,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:31:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:48,093 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 18:31:48,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211112587] [2019-12-07 18:31:48,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:31:48,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 18:31:48,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064405841] [2019-12-07 18:31:48,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 18:31:48,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:31:48,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 18:31:48,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:31:48,095 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 16 states. [2019-12-07 18:31:49,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:31:49,832 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2019-12-07 18:31:49,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 18:31:49,832 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 91 [2019-12-07 18:31:49,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:31:49,833 INFO L225 Difference]: With dead ends: 122 [2019-12-07 18:31:49,833 INFO L226 Difference]: Without dead ends: 122 [2019-12-07 18:31:49,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-12-07 18:31:49,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-12-07 18:31:49,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 109. [2019-12-07 18:31:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 18:31:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2019-12-07 18:31:49,836 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 91 [2019-12-07 18:31:49,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:31:49,836 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2019-12-07 18:31:49,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 18:31:49,836 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2019-12-07 18:31:49,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 18:31:49,837 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:31:49,837 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 18:31:49,837 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 18:31:49,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:31:49,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1245177897, now seen corresponding path program 1 times [2019-12-07 18:31:49,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:31:49,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438237947] [2019-12-07 18:31:49,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:31:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:49,993 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 18:31:49,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438237947] [2019-12-07 18:31:49,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043588691] [2019-12-07 18:31:49,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/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 18:31:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:50,083 INFO L264 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 18:31:50,084 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:31:50,109 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 18:31:50,109 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:31:50,110 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:31:50,110 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 18:31:50,111 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-12-07 18:31:50,118 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 18:31:50,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:31:50,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2019-12-07 18:31:50,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650804630] [2019-12-07 18:31:50,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 18:31:50,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:31:50,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:31:50,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:31:50,119 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 15 states. [2019-12-07 18:31:51,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:31:51,328 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2019-12-07 18:31:51,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 18:31:51,329 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 94 [2019-12-07 18:31:51,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:31:51,330 INFO L225 Difference]: With dead ends: 122 [2019-12-07 18:31:51,330 INFO L226 Difference]: Without dead ends: 122 [2019-12-07 18:31:51,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2019-12-07 18:31:51,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-12-07 18:31:51,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 109. [2019-12-07 18:31:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 18:31:51,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2019-12-07 18:31:51,334 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 94 [2019-12-07 18:31:51,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:31:51,334 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2019-12-07 18:31:51,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 18:31:51,334 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2019-12-07 18:31:51,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 18:31:51,335 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:31:51,335 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 18:31:51,535 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:31:51,536 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 18:31:51,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:31:51,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1245177898, now seen corresponding path program 1 times [2019-12-07 18:31:51,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:31:51,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895971050] [2019-12-07 18:31:51,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:31:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:31:53,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895971050] [2019-12-07 18:31:53,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334666298] [2019-12-07 18:31:53,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/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 18:31:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:31:53,129 INFO L264 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 125 conjunts are in the unsatisfiable core [2019-12-07 18:31:53,131 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:31:53,224 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:31:53,224 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 18:31:53,224 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:31:53,231 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:31:53,231 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:31:53,231 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2019-12-07 18:31:53,416 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 18:31:53,417 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:31:53,463 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:31:53,467 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 18:31:53,467 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:31:53,482 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:31:53,482 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:31:53,482 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2019-12-07 18:31:53,563 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 18:31:53,563 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:31:53,578 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:31:53,580 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 18:31:53,581 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:31:53,595 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:31:53,596 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:31:53,596 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2019-12-07 18:31:53,744 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:31:53,756 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:31:53,756 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 70 [2019-12-07 18:31:53,756 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:31:53,805 INFO L614 ElimStorePlain]: treesize reduction 20, result has 79.2 percent of original size [2019-12-07 18:31:53,809 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 55 treesize of output 44 [2019-12-07 18:31:53,809 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:31:53,834 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:31:53,834 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:31:53,834 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:56 [2019-12-07 18:31:54,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:31:54,084 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:31:54,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:31:54,088 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:31:54,120 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:31:54,121 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 4 case distinctions, treesize of input 70 treesize of output 82 [2019-12-07 18:31:54,122 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:31:54,306 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-12-07 18:31:54,307 INFO L614 ElimStorePlain]: treesize reduction 70, result has 59.3 percent of original size [2019-12-07 18:31:54,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:31:54,320 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 47 treesize of output 52 [2019-12-07 18:31:54,321 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:31:54,397 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:31:54,397 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:31:54,398 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:98 [2019-12-07 18:31:55,972 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 18:31:55,974 INFO L430 ElimStorePlain]: Different costs {10=[|v_#memory_$Pointer$.base_BEFORE_CALL_16|], 18=[|v_#memory_$Pointer$.offset_BEFORE_CALL_11|]} [2019-12-07 18:31:55,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:31:55,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:31:55,979 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:31:55,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:31:55,980 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:31:55,988 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:31:55,988 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 107 treesize of output 66 [2019-12-07 18:31:55,988 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 18:31:56,003 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:31:56,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:31:56,021 INFO L343 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2019-12-07 18:31:56,022 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 55 [2019-12-07 18:31:56,022 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:31:56,036 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:31:56,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:31:56,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:31:56,037 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 18:31:56,037 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:129, output treesize:67 [2019-12-07 18:31:57,557 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base| (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_dll_circular_update_at_#in~head.base|) .cse0))))) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))) is different from true [2019-12-07 18:31:57,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:31:57,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:31:57,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:31:57,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:31:57,580 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2019-12-07 18:31:57,580 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:31:57,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:31:57,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:31:57,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:31:57,589 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2019-12-07 18:31:57,589 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:31:57,615 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:31:57,615 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 2 xjuncts. [2019-12-07 18:31:57,615 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:113, output treesize:69 [2019-12-07 18:31:58,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:31:58,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:31:58,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:31:58,826 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-12-07 18:31:58,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:31:59,410 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-12-07 18:32:00,595 WARN L192 SmtUtils]: Spent 538.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-12-07 18:32:00,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:00,599 INFO L430 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 54=[|#memory_$Pointer$.offset|]} [2019-12-07 18:32:00,606 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 18:32:00,606 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:32:00,609 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 18:32:00,610 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:32:00,642 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:32:00,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:32:00,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:32:00,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:32:00,658 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:32:00,682 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:32:00,683 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 97 [2019-12-07 18:32:00,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:32:00,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:00,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:32:00,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:00,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:32:00,685 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:32:00,692 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:32:00,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, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 39 [2019-12-07 18:32:00,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:00,693 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 18:32:00,734 INFO L614 ElimStorePlain]: treesize reduction 169, result has 18.0 percent of original size [2019-12-07 18:32:00,734 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:32:00,734 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:183, output treesize:11 [2019-12-07 18:32:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2019-12-07 18:32:00,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:32:00,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 40] total 69 [2019-12-07 18:32:00,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907574013] [2019-12-07 18:32:00,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-12-07 18:32:00,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:32:00,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-12-07 18:32:00,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=4327, Unknown=2, NotChecked=266, Total=4830 [2019-12-07 18:32:00,914 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 70 states. [2019-12-07 18:32:02,618 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-12-07 18:32:05,993 WARN L192 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2019-12-07 18:32:08,327 WARN L192 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 39 DAG size of output: 26 [2019-12-07 18:32:09,721 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 96 [2019-12-07 18:32:11,507 WARN L192 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-12-07 18:32:11,803 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-12-07 18:32:12,112 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-12-07 18:32:12,765 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-12-07 18:32:13,166 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-12-07 18:32:13,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:32:13,342 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2019-12-07 18:32:13,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 18:32:13,343 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 94 [2019-12-07 18:32:13,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:32:13,344 INFO L225 Difference]: With dead ends: 119 [2019-12-07 18:32:13,344 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 18:32:13,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 67 SyntacticMatches, 12 SemanticMatches, 95 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=642, Invalid=8294, Unknown=2, NotChecked=374, Total=9312 [2019-12-07 18:32:13,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 18:32:13,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2019-12-07 18:32:13,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 18:32:13,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2019-12-07 18:32:13,346 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 94 [2019-12-07 18:32:13,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:32:13,347 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2019-12-07 18:32:13,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-12-07 18:32:13,347 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2019-12-07 18:32:13,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 18:32:13,347 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:32:13,347 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 18:32:13,548 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:32:13,548 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 18:32:13,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:32:13,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1277668637, now seen corresponding path program 1 times [2019-12-07 18:32:13,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:32:13,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286666673] [2019-12-07 18:32:13,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:32:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:13,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:13,732 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 18:32:13,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286666673] [2019-12-07 18:32:13,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:32:13,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 18:32:13,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823454439] [2019-12-07 18:32:13,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 18:32:13,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:32:13,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 18:32:13,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:32:13,733 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand 16 states. [2019-12-07 18:32:14,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:32:14,170 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2019-12-07 18:32:14,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 18:32:14,171 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 94 [2019-12-07 18:32:14,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:32:14,171 INFO L225 Difference]: With dead ends: 117 [2019-12-07 18:32:14,171 INFO L226 Difference]: Without dead ends: 115 [2019-12-07 18:32:14,172 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 18:32:14,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-12-07 18:32:14,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2019-12-07 18:32:14,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 18:32:14,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2019-12-07 18:32:14,174 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 94 [2019-12-07 18:32:14,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:32:14,174 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2019-12-07 18:32:14,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 18:32:14,174 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2019-12-07 18:32:14,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 18:32:14,174 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:32:14,175 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 18:32:14,175 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 18:32:14,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:32:14,175 INFO L82 PathProgramCache]: Analyzing trace with hash -54192191, now seen corresponding path program 1 times [2019-12-07 18:32:14,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:32:14,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532515328] [2019-12-07 18:32:14,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:32:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:14,320 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 18:32:14,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532515328] [2019-12-07 18:32:14,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:32:14,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 18:32:14,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566766129] [2019-12-07 18:32:14,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 18:32:14,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:32:14,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:32:14,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:32:14,322 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand 15 states. [2019-12-07 18:32:14,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:32:14,811 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2019-12-07 18:32:14,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 18:32:14,812 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 95 [2019-12-07 18:32:14,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:32:14,812 INFO L225 Difference]: With dead ends: 113 [2019-12-07 18:32:14,812 INFO L226 Difference]: Without dead ends: 113 [2019-12-07 18:32:14,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-12-07 18:32:14,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-12-07 18:32:14,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2019-12-07 18:32:14,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 18:32:14,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2019-12-07 18:32:14,815 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 95 [2019-12-07 18:32:14,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:32:14,815 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2019-12-07 18:32:14,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 18:32:14,815 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2019-12-07 18:32:14,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 18:32:14,816 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:32:14,816 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 18:32:14,816 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 18:32:14,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:32:14,817 INFO L82 PathProgramCache]: Analyzing trace with hash -537663962, now seen corresponding path program 1 times [2019-12-07 18:32:14,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:32:14,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641185170] [2019-12-07 18:32:14,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:32:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:15,619 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 18:32:15,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641185170] [2019-12-07 18:32:15,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385101222] [2019-12-07 18:32:15,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/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 18:32:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:15,706 INFO L264 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 91 conjunts are in the unsatisfiable core [2019-12-07 18:32:15,708 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:32:15,747 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 18:32:15,747 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:32:15,750 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:32:15,750 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 18:32:15,750 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-12-07 18:32:15,841 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:32:15,841 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 18:32:15,841 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:32:15,845 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:32:15,845 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:32:15,845 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2019-12-07 18:32:15,918 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 18:32:15,918 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:32:15,924 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:32:15,924 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:32:15,925 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-12-07 18:32:15,970 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 18:32:15,971 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:32:15,977 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:32:15,977 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 18:32:15,977 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-12-07 18:32:16,091 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:32:16,091 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 18:32:16,091 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:32:16,109 INFO L614 ElimStorePlain]: treesize reduction 22, result has 60.0 percent of original size [2019-12-07 18:32:16,110 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 18:32:16,110 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-12-07 18:32:16,198 INFO L343 Elim1Store]: treesize reduction 34, result has 60.0 percent of original size [2019-12-07 18:32:16,199 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 18:32:16,199 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:32:16,216 INFO L614 ElimStorePlain]: treesize reduction 58, result has 46.3 percent of original size [2019-12-07 18:32:16,217 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 18:32:16,217 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:50 [2019-12-07 18:32:16,629 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2019-12-07 18:32:16,630 INFO L343 Elim1Store]: treesize reduction 10, result has 75.6 percent of original size [2019-12-07 18:32:16,631 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 18:32:16,632 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:32:16,638 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:32:16,638 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 18:32:16,639 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:53, output treesize:3 [2019-12-07 18:32:18,753 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 18:32:18,869 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-12-07 18:32:18,870 INFO L343 Elim1Store]: treesize reduction 10, result has 94.4 percent of original size [2019-12-07 18:32:18,870 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 18:32:18,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:18,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:18,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:32:18,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:18,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:18,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:32:18,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:18,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:18,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:18,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:32:18,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:18,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:18,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:18,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:18,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:18,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:18,876 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-12-07 18:32:19,000 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 31 [2019-12-07 18:32:19,000 INFO L614 ElimStorePlain]: treesize reduction 1325, result has 8.6 percent of original size [2019-12-07 18:32:19,001 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 18:32:19,001 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:106 [2019-12-07 18:32:19,089 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-12-07 18:32:19,089 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 35 treesize of output 13 [2019-12-07 18:32:19,089 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:32:19,090 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:32:19,090 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 18:32:19,090 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2019-12-07 18:32:19,931 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 18:32:19,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:32:19,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:32:19,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:32:19,937 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:32:19,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, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 29 [2019-12-07 18:32:19,938 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:32:19,944 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:32:19,944 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:32:19,944 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:31 [2019-12-07 18:32:20,789 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-12-07 18:32:20,790 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 18:32:20,790 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 18:32:20,798 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:32:20,798 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 18:32:20,799 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:5 [2019-12-07 18:32:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 2 not checked. [2019-12-07 18:32:20,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:32:20,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 54 [2019-12-07 18:32:20,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281005433] [2019-12-07 18:32:20,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-12-07 18:32:20,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:32:20,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-12-07 18:32:20,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2603, Unknown=2, NotChecked=206, Total=2970 [2019-12-07 18:32:20,828 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand 55 states. [2019-12-07 18:32:28,178 WARN L192 SmtUtils]: Spent 2.70 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-12-07 18:32:30,312 WARN L192 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-12-07 18:32:31,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:32:31,645 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2019-12-07 18:32:31,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 18:32:31,646 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 97 [2019-12-07 18:32:31,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:32:31,646 INFO L225 Difference]: With dead ends: 114 [2019-12-07 18:32:31,646 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 18:32:31,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 83 SyntacticMatches, 7 SemanticMatches, 80 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=462, Invalid=5864, Unknown=2, NotChecked=314, Total=6642 [2019-12-07 18:32:31,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 18:32:31,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2019-12-07 18:32:31,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 18:32:31,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2019-12-07 18:32:31,649 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 97 [2019-12-07 18:32:31,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:32:31,649 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2019-12-07 18:32:31,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-12-07 18:32:31,649 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2019-12-07 18:32:31,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 18:32:31,650 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:32:31,650 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 18:32:31,850 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:32:31,851 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 18:32:31,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:32:31,852 INFO L82 PathProgramCache]: Analyzing trace with hash -879679983, now seen corresponding path program 1 times [2019-12-07 18:32:31,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:32:31,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61304761] [2019-12-07 18:32:31,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:32:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:32,555 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 18:32:32,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61304761] [2019-12-07 18:32:32,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690765167] [2019-12-07 18:32:32,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/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 18:32:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:32:32,641 INFO L264 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 99 conjunts are in the unsatisfiable core [2019-12-07 18:32:32,643 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:32:32,657 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:32:32,657 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 18:32:32,657 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:32:32,662 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:32:32,662 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:32:32,662 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-12-07 18:32:32,672 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 18:32:32,673 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:32:32,678 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:32:32,678 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:32:32,678 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-12-07 18:32:32,713 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 18:32:32,713 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:32:32,719 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:32:32,720 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 18:32:32,720 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-12-07 18:32:32,821 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:32:32,821 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 18:32:32,821 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:32:32,838 INFO L614 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-12-07 18:32:32,838 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 18:32:32,839 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2019-12-07 18:32:32,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:32:32,898 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:32:32,898 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 18:32:32,898 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:32:32,915 INFO L614 ElimStorePlain]: treesize reduction 50, result has 43.2 percent of original size [2019-12-07 18:32:32,916 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 18:32:32,916 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2019-12-07 18:32:34,214 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 18:32:34,298 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:32:34,298 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 18:32:34,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:34,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:32:34,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:32:34,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:32:34,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:34,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:34,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:32:34,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:34,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:34,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:32:34,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:32:34,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:34,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:34,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:32:34,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:34,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:34,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:32:34,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:32:34,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:32:34,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:34,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:34,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:32:34,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:34,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:34,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:32:34,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:32:34,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:34,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:34,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:32:34,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:34,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:32:34,310 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-12-07 18:32:34,509 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 24 [2019-12-07 18:32:34,509 INFO L614 ElimStorePlain]: treesize reduction 6002, result has 0.7 percent of original size [2019-12-07 18:32:34,509 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 18:32:34,510 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:23 [2019-12-07 18:32:35,429 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 18:32:35,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:32:35,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:32:35,434 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:32:35,434 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2019-12-07 18:32:35,435 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:32:35,440 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:32:35,441 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:32:35,441 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:23 [2019-12-07 18:32:48,005 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 2 not checked. [2019-12-07 18:32:48,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:32:48,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 54 [2019-12-07 18:32:48,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949795539] [2019-12-07 18:32:48,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-12-07 18:32:48,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:32:48,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-12-07 18:32:48,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2486, Unknown=2, NotChecked=202, Total=2862 [2019-12-07 18:32:48,007 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 54 states. [2019-12-07 18:33:11,995 WARN L192 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-12-07 18:33:19,959 WARN L192 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-12-07 18:33:23,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:33:23,090 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2019-12-07 18:33:23,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 18:33:23,090 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 100 [2019-12-07 18:33:23,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:33:23,091 INFO L225 Difference]: With dead ends: 114 [2019-12-07 18:33:23,091 INFO L226 Difference]: Without dead ends: 109 [2019-12-07 18:33:23,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 89 SyntacticMatches, 9 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=458, Invalid=4948, Unknown=4, NotChecked=290, Total=5700 [2019-12-07 18:33:23,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-07 18:33:23,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-12-07 18:33:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-12-07 18:33:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2019-12-07 18:33:23,094 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 100 [2019-12-07 18:33:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:33:23,094 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2019-12-07 18:33:23,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-12-07 18:33:23,094 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2019-12-07 18:33:23,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 18:33:23,095 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:33:23,095 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 18:33:23,295 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:33:23,296 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 18:33:23,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:33:23,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1613837938, now seen corresponding path program 1 times [2019-12-07 18:33:23,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:33:23,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422546177] [2019-12-07 18:33:23,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:33:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:24,826 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 18:33:24,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422546177] [2019-12-07 18:33:24,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055507360] [2019-12-07 18:33:24,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/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 18:33:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:24,921 INFO L264 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 136 conjunts are in the unsatisfiable core [2019-12-07 18:33:24,924 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:33:25,002 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:25,002 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 18:33:25,002 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:25,009 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:25,010 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:33:25,010 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2019-12-07 18:33:25,031 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 18:33:25,031 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:25,039 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:25,040 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:33:25,040 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-12-07 18:33:25,093 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 18:33:25,094 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:25,100 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:25,101 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:33:25,101 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-12-07 18:33:25,210 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_47|], 4=[|v_#memory_$Pointer$.base_75|]} [2019-12-07 18:33:25,213 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 11 treesize of output 7 [2019-12-07 18:33:25,213 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:25,224 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:25,234 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:25,235 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 38 treesize of output 51 [2019-12-07 18:33:25,235 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:25,257 INFO L614 ElimStorePlain]: treesize reduction 16, result has 70.9 percent of original size [2019-12-07 18:33:25,257 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:33:25,257 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:39 [2019-12-07 18:33:25,319 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_48|], 7=[|v_#memory_$Pointer$.base_76|]} [2019-12-07 18:33:25,323 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 18:33:25,323 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:25,336 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:25,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:33:25,338 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:33:25,350 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:25,350 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 4 case distinctions, treesize of input 59 treesize of output 75 [2019-12-07 18:33:25,350 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:25,376 INFO L614 ElimStorePlain]: treesize reduction 40, result has 65.2 percent of original size [2019-12-07 18:33:25,376 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:33:25,376 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:75 [2019-12-07 18:33:27,601 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|)) (.cse1 (+ dll_circular_update_at_~head.offset 8))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)))) (= (store |c_old(#memory_$Pointer$.offset)| .cse0 (store (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) |c_#memory_$Pointer$.offset|) (<= (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|) dll_circular_update_at_~head.offset)))) is different from true [2019-12-07 18:33:27,604 INFO L430 ElimStorePlain]: Different costs {10=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_73|], 20=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_73|]} [2019-12-07 18:33:27,608 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:33:27,619 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:27,620 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 57 treesize of output 69 [2019-12-07 18:33:27,620 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:27,663 INFO L614 ElimStorePlain]: treesize reduction 28, result has 79.3 percent of original size [2019-12-07 18:33:27,736 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:27,737 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 90 treesize of output 228 [2019-12-07 18:33:27,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:27,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:27,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:27,739 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 18:33:27,808 INFO L614 ElimStorePlain]: treesize reduction 312, result has 22.0 percent of original size [2019-12-07 18:33:27,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:27,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:27,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:27,809 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 18:33:27,809 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:132, output treesize:119 [2019-12-07 18:33:29,542 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 18:33:29,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:29,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:29,612 INFO L430 ElimStorePlain]: Different costs {10=[|v_#memory_$Pointer$.offset_BEFORE_CALL_17|], 15=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_74|]} [2019-12-07 18:33:29,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:33:29,628 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2019-12-07 18:33:29,629 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:29,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:33:29,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:33:29,654 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:29,655 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 2 case distinctions, treesize of input 47 treesize of output 49 [2019-12-07 18:33:29,655 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:29,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:33:29,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:33:29,664 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-12-07 18:33:29,664 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:29,794 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-12-07 18:33:29,794 INFO L614 ElimStorePlain]: treesize reduction 16, result has 93.6 percent of original size [2019-12-07 18:33:29,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:33:29,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:33:29,825 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:29,825 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 4 case distinctions, treesize of input 72 treesize of output 68 [2019-12-07 18:33:29,826 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:29,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:33:29,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:33:29,847 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:29,847 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 2 case distinctions, treesize of input 53 treesize of output 46 [2019-12-07 18:33:29,847 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:29,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:33:29,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:33:29,857 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:29,857 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 2 case distinctions, treesize of input 50 treesize of output 43 [2019-12-07 18:33:29,858 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:29,939 INFO L614 ElimStorePlain]: treesize reduction 48, result has 78.6 percent of original size [2019-12-07 18:33:29,939 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 18:33:29,940 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:290, output treesize:167 [2019-12-07 18:33:30,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:30,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:31,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:31,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:33,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:33,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:33,383 INFO L430 ElimStorePlain]: Different costs {15=[|#memory_$Pointer$.offset|], 20=[|#memory_$Pointer$.base|]} [2019-12-07 18:33:33,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:33:33,387 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:33:33,389 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:33:33,398 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:33,398 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 26 [2019-12-07 18:33:33,398 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:33,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:33:33,402 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:33:33,412 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:33,413 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 1 case distinctions, treesize of input 37 treesize of output 21 [2019-12-07 18:33:33,413 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 18:33:33,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:33:33,417 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2019-12-07 18:33:33,417 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:33,462 INFO L614 ElimStorePlain]: treesize reduction 115, result has 36.8 percent of original size [2019-12-07 18:33:33,534 INFO L343 Elim1Store]: treesize reduction 8, result has 90.9 percent of original size [2019-12-07 18:33:33,534 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 102 [2019-12-07 18:33:33,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:33:33,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:33:33,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:33:33,536 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:33,550 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:33,550 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:33:33,550 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:271, output treesize:31 [2019-12-07 18:33:33,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:33,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:33,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:33,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:33,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:33,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:33,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:33,900 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 2 not checked. [2019-12-07 18:33:33,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:33:33,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 63 [2019-12-07 18:33:33,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546327536] [2019-12-07 18:33:33,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-12-07 18:33:33,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:33:33,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-12-07 18:33:33,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=3484, Unknown=2, NotChecked=238, Total=3906 [2019-12-07 18:33:33,901 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand 63 states. [2019-12-07 18:33:35,559 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 64 [2019-12-07 18:33:36,434 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-12-07 18:33:40,132 WARN L192 SmtUtils]: Spent 3.38 s on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2019-12-07 18:33:42,001 WARN L192 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 67 DAG size of output: 34 [2019-12-07 18:33:43,500 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 104 [2019-12-07 18:33:43,854 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 104 [2019-12-07 18:33:44,893 WARN L192 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 93 [2019-12-07 18:33:45,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:33:45,613 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2019-12-07 18:33:45,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 18:33:45,613 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 100 [2019-12-07 18:33:45,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:33:45,614 INFO L225 Difference]: With dead ends: 100 [2019-12-07 18:33:45,614 INFO L226 Difference]: Without dead ends: 100 [2019-12-07 18:33:45,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 67 SyntacticMatches, 23 SemanticMatches, 86 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1610 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=514, Invalid=6802, Unknown=2, NotChecked=338, Total=7656 [2019-12-07 18:33:45,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-07 18:33:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-12-07 18:33:45,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-07 18:33:45,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2019-12-07 18:33:45,616 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 100 [2019-12-07 18:33:45,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:33:45,617 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2019-12-07 18:33:45,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-12-07 18:33:45,617 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2019-12-07 18:33:45,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 18:33:45,617 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:33:45,617 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] [2019-12-07 18:33:45,818 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:33:45,819 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 18:33:45,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:33:45,820 INFO L82 PathProgramCache]: Analyzing trace with hash -415105698, now seen corresponding path program 1 times [2019-12-07 18:33:45,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:33:45,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599014157] [2019-12-07 18:33:45,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:33:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:46,556 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 18:33:46,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599014157] [2019-12-07 18:33:46,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196426055] [2019-12-07 18:33:46,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/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 18:33:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:46,642 INFO L264 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 18:33:46,644 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:33:46,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:46,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:46,976 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:46,977 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 18:33:46,977 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:46,999 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 18:33:46,999 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:47,155 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-12-07 18:33:47,156 INFO L614 ElimStorePlain]: treesize reduction 23, result has 54.0 percent of original size [2019-12-07 18:33:47,157 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 2 xjuncts. [2019-12-07 18:33:47,157 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:24 [2019-12-07 18:33:47,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:47,383 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 18:33:47,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:33:47,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 7] total 37 [2019-12-07 18:33:47,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161651835] [2019-12-07 18:33:47,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-07 18:33:47,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:33:47,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-07 18:33:47,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1307, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 18:33:47,385 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 38 states. [2019-12-07 18:33:49,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:33:49,771 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2019-12-07 18:33:49,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 18:33:49,771 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 102 [2019-12-07 18:33:49,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:33:49,772 INFO L225 Difference]: With dead ends: 99 [2019-12-07 18:33:49,772 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 18:33:49,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 108 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=301, Invalid=3005, Unknown=0, NotChecked=0, Total=3306 [2019-12-07 18:33:49,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 18:33:49,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-12-07 18:33:49,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-07 18:33:49,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2019-12-07 18:33:49,774 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 102 [2019-12-07 18:33:49,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:33:49,774 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2019-12-07 18:33:49,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-07 18:33:49,774 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2019-12-07 18:33:49,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-07 18:33:49,775 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:33:49,775 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 18:33:49,975 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:33:49,976 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 18:33:49,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:33:49,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1368434614, now seen corresponding path program 1 times [2019-12-07 18:33:49,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:33:49,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546302720] [2019-12-07 18:33:49,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:33:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:51,020 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 18:33:51,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546302720] [2019-12-07 18:33:51,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028869894] [2019-12-07 18:33:51,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/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 18:33:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:51,111 INFO L264 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 109 conjunts are in the unsatisfiable core [2019-12-07 18:33:51,113 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:33:51,310 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:51,311 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 18:33:51,311 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:51,339 INFO L614 ElimStorePlain]: treesize reduction 28, result has 54.8 percent of original size [2019-12-07 18:33:51,339 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:33:51,339 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:34 [2019-12-07 18:33:51,452 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 18:33:51,452 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:51,464 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:51,464 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:33:51,464 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-12-07 18:33:51,538 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 18:33:51,538 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:51,551 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:51,551 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 18:33:51,551 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:47 [2019-12-07 18:33:51,712 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:51,712 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 18:33:51,713 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:51,746 INFO L614 ElimStorePlain]: treesize reduction 22, result has 71.1 percent of original size [2019-12-07 18:33:51,746 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 18:33:51,746 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2019-12-07 18:33:51,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:33:51,836 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:51,836 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 18:33:51,837 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:51,868 INFO L614 ElimStorePlain]: treesize reduction 50, result has 58.0 percent of original size [2019-12-07 18:33:51,868 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 18:33:51,868 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:69 [2019-12-07 18:33:52,226 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 18:33:52,226 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:52,238 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:52,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:33:52,251 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:52,252 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 44 treesize of output 49 [2019-12-07 18:33:52,252 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 18:33:52,260 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:52,260 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 18:33:52,260 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:72, output treesize:18 [2019-12-07 18:34:06,553 WARN L192 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 29 [2019-12-07 18:34:06,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:34:06,610 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:34:06,610 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 84 treesize of output 200 [2019-12-07 18:34:06,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:34:06,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:34:06,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:34:06,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:34:06,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:34:06,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:34:06,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:34:06,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:34:06,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:34:06,614 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-12-07 18:34:06,710 INFO L614 ElimStorePlain]: treesize reduction 824, result has 10.7 percent of original size [2019-12-07 18:34:06,711 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:34:06,711 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:114, output treesize:76 [2019-12-07 18:34:06,821 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 18:34:06,821 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:34:06,832 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:34:06,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:34:06,835 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 13 [2019-12-07 18:34:06,836 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 18:34:06,844 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:34:06,844 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:34:06,844 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:18 [2019-12-07 18:34:19,893 WARN L192 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 29 [2019-12-07 18:34:19,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:34:19,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:34:19,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:34:19,924 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 34 [2019-12-07 18:34:19,924 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:34:19,942 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:34:19,943 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 18:34:19,943 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:98, output treesize:70 [2019-12-07 18:34:20,031 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 18:34:20,031 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:34:20,040 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:34:20,040 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 18:34:20,040 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:46 [2019-12-07 18:34:20,299 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 18:34:20,300 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:34:20,309 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:34:20,309 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 18:34:20,309 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:46 [2019-12-07 18:34:20,441 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 18:34:20,441 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:34:20,453 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:34:20,455 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 18:34:20,456 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:34:20,463 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:34:20,463 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 18:34:20,463 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:33 [2019-12-07 18:34:22,917 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2019-12-07 18:34:25,051 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2019-12-07 18:34:27,203 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 30 [2019-12-07 18:34:27,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:34:27,210 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:34:27,210 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2019-12-07 18:34:27,211 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:34:27,234 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:34:27,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:34:27,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:34:27,238 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:34:27,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:34:27,239 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:34:27,240 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:34:27,248 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:34:27,248 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 67 treesize of output 41 [2019-12-07 18:34:27,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:34:27,249 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 18:34:27,273 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:34:27,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:34:27,274 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 18:34:27,274 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:110, output treesize:51 [2019-12-07 18:34:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 18:34:27,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:34:27,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 36] total 65 [2019-12-07 18:34:27,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294733539] [2019-12-07 18:34:27,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-12-07 18:34:27,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:27,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-12-07 18:34:27,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=4055, Unknown=20, NotChecked=0, Total=4290 [2019-12-07 18:34:27,456 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand 66 states. [2019-12-07 18:34:42,641 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 58 [2019-12-07 18:34:53,147 WARN L192 SmtUtils]: Spent 1.38 s on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 18:35:02,962 WARN L192 SmtUtils]: Spent 854.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 18:35:10,541 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 38 [2019-12-07 18:35:12,705 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 41 [2019-12-07 18:35:14,880 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 18:35:19,083 WARN L192 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2019-12-07 18:35:19,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:19,119 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2019-12-07 18:35:19,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 18:35:19,120 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 106 [2019-12-07 18:35:19,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:19,120 INFO L225 Difference]: With dead ends: 98 [2019-12-07 18:35:19,120 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 18:35:19,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 85 SyntacticMatches, 7 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1924 ImplicationChecksByTransitivity, 55.1s TimeCoverageRelationStatistics Valid=508, Invalid=7842, Unknown=22, NotChecked=0, Total=8372 [2019-12-07 18:35:19,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 18:35:19,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 18:35:19,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 18:35:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 18:35:19,121 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2019-12-07 18:35:19,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:19,121 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:35:19,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-12-07 18:35:19,121 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 18:35:19,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 18:35:19,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:19,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:35:19 BoogieIcfgContainer [2019-12-07 18:35:19,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:35:19,332 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:35:19,332 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:35:19,332 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:35:19,333 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:22:13" (3/4) ... [2019-12-07 18:35:19,339 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 18:35:19,346 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-07 18:35:19,347 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-12-07 18:35:19,347 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_destroy [2019-12-07 18:35:19,347 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-12-07 18:35:19,347 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-12-07 18:35:19,347 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-07 18:35:19,347 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_create [2019-12-07 18:35:19,347 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_update_at [2019-12-07 18:35:19,347 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-12-07 18:35:19,347 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_get_data_at [2019-12-07 18:35:19,351 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2019-12-07 18:35:19,352 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-12-07 18:35:19,352 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 18:35:19,352 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 18:35:19,386 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8e498345-0300-4b84-9e51-506bbbc04685/bin/uautomizer/witness.graphml [2019-12-07 18:35:19,386 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:35:19,387 INFO L168 Benchmark]: Toolchain (without parser) took 786193.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 940.9 MB in the beginning and 903.9 MB in the end (delta: 36.9 MB). Peak memory consumption was 208.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:35:19,387 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:35:19,387 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:35:19,387 INFO L168 Benchmark]: Boogie Preprocessor took 43.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:35:19,388 INFO L168 Benchmark]: RCFGBuilder took 385.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:35:19,388 INFO L168 Benchmark]: TraceAbstraction took 785348.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.5 MB). Free memory was 1.1 GB in the beginning and 913.7 MB in the end (delta: 141.7 MB). Peak memory consumption was 163.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:35:19,388 INFO L168 Benchmark]: Witness Printer took 54.53 ms. Allocated memory is still 1.2 GB. Free memory was 913.7 MB in the beginning and 903.9 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:35:19,389 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 358.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 385.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 785348.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.5 MB). Free memory was 1.1 GB in the beginning and 913.7 MB in the end (delta: 141.7 MB). Peak memory consumption was 163.1 MB. Max. memory is 11.5 GB. * Witness Printer took 54.53 ms. Allocated memory is still 1.2 GB. Free memory was 913.7 MB in the beginning and 903.9 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 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: 785.3s, OverallIterations: 41, TraceHistogramMax: 3, AutomataDifference: 449.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2657 SDtfs, 7243 SDslu, 13831 SDs, 0 SdLazy, 49158 SolverSat, 1841 SolverUnsat, 95 SolverUnknown, 0 SolverNotchecked, 191.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2960 GetRequests, 1501 SyntacticMatches, 103 SemanticMatches, 1356 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 15226 ImplicationChecksByTransitivity, 569.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=25, 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, 41 MinimizatonAttempts, 732 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 328.5s InterpolantComputationTime, 3966 NumberOfCodeBlocks, 3966 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 3904 ConstructedInterpolants, 299 QuantifiedInterpolants, 4406315 SizeOfPredicates, 315 NumberOfNonLiveVariables, 7241 ConjunctsInSsa, 1170 ConjunctsInUnsatCore, 62 InterpolantComputations, 21 PerfectInterpolantSequences, 885/1304 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...