./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16891def4f6ae6ab6c00fe328146dbdee1a68356 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 09:43:59,189 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:43:59,190 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:43:59,196 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:43:59,196 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:43:59,197 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:43:59,197 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:43:59,198 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:43:59,199 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:43:59,200 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:43:59,200 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:43:59,200 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:43:59,201 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:43:59,201 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:43:59,202 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:43:59,202 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:43:59,202 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:43:59,203 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:43:59,204 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:43:59,205 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:43:59,205 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:43:59,206 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:43:59,207 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:43:59,207 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:43:59,207 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:43:59,208 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:43:59,208 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:43:59,209 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:43:59,209 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:43:59,210 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:43:59,210 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:43:59,210 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:43:59,210 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:43:59,210 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:43:59,211 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:43:59,211 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:43:59,211 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-09 09:43:59,218 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:43:59,219 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:43:59,219 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 09:43:59,219 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 09:43:59,220 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 09:43:59,220 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 09:43:59,220 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 09:43:59,220 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:43:59,220 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 09:43:59,220 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 09:43:59,220 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 09:43:59,220 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 09:43:59,220 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:43:59,220 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 09:43:59,220 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 09:43:59,221 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 09:43:59,221 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 09:43:59,221 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 09:43:59,221 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 09:43:59,221 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:43:59,221 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:43:59,221 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 09:43:59,221 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 09:43:59,221 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:43:59,221 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:43:59,221 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 09:43:59,221 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 09:43:59,222 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 09:43:59,222 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16891def4f6ae6ab6c00fe328146dbdee1a68356 [2018-12-09 09:43:59,239 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:43:59,246 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:43:59,248 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:43:59,249 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:43:59,249 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:43:59,250 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-09 09:43:59,282 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/data/eb4f5568a/100da6ca6cb84e3784fc0a4c46460709/FLAG77b428f8d [2018-12-09 09:43:59,748 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:43:59,748 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/sv-benchmarks/c/list-simple/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-09 09:43:59,754 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/data/eb4f5568a/100da6ca6cb84e3784fc0a4c46460709/FLAG77b428f8d [2018-12-09 09:43:59,762 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/data/eb4f5568a/100da6ca6cb84e3784fc0a4c46460709 [2018-12-09 09:43:59,764 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:43:59,765 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-09 09:43:59,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:43:59,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:43:59,769 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:43:59,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:43:59" (1/1) ... [2018-12-09 09:43:59,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f91bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:43:59, skipping insertion in model container [2018-12-09 09:43:59,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:43:59" (1/1) ... [2018-12-09 09:43:59,777 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:43:59,799 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:43:59,966 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:44:00,012 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:44:00,040 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:44:00,066 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:44:00,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:44:00 WrapperNode [2018-12-09 09:44:00,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:44:00,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:44:00,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:44:00,067 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:44:00,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:44:00" (1/1) ... [2018-12-09 09:44:00,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:44:00" (1/1) ... [2018-12-09 09:44:00,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:44:00" (1/1) ... [2018-12-09 09:44:00,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:44:00" (1/1) ... [2018-12-09 09:44:00,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:44:00" (1/1) ... [2018-12-09 09:44:00,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:44:00" (1/1) ... [2018-12-09 09:44:00,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:44:00" (1/1) ... [2018-12-09 09:44:00,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:44:00,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:44:00,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:44:00,109 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:44:00,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:44:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:44:00,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 09:44:00,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:44:00,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-09 09:44:00,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-09 09:44:00,141 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 09:44:00,141 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-09 09:44:00,141 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-12-09 09:44:00,142 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2018-12-09 09:44:00,142 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2018-12-09 09:44:00,142 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2018-12-09 09:44:00,142 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 09:44:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-09 09:44:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-09 09:44:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-09 09:44:00,142 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-09 09:44:00,143 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-09 09:44:00,143 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-09 09:44:00,143 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-09 09:44:00,143 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-09 09:44:00,143 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-09 09:44:00,143 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-09 09:44:00,143 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-09 09:44:00,143 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-09 09:44:00,143 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-09 09:44:00,143 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-09 09:44:00,144 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-09 09:44:00,144 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-09 09:44:00,144 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-09 09:44:00,144 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-09 09:44:00,144 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-09 09:44:00,144 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-09 09:44:00,144 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-09 09:44:00,144 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-09 09:44:00,144 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-09 09:44:00,144 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-09 09:44:00,144 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-09 09:44:00,145 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-09 09:44:00,145 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-09 09:44:00,145 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-09 09:44:00,145 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-09 09:44:00,145 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-09 09:44:00,145 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-09 09:44:00,145 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-09 09:44:00,145 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-09 09:44:00,145 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-09 09:44:00,145 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-09 09:44:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-09 09:44:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-09 09:44:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-09 09:44:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-09 09:44:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-09 09:44:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-09 09:44:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-09 09:44:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-09 09:44:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-09 09:44:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-09 09:44:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-09 09:44:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-09 09:44:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-09 09:44:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-09 09:44:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-09 09:44:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-09 09:44:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-09 09:44:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-09 09:44:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-09 09:44:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-09 09:44:00,147 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-09 09:44:00,148 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-09 09:44:00,148 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-09 09:44:00,148 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-09 09:44:00,148 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-09 09:44:00,148 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-09 09:44:00,148 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-09 09:44:00,148 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-09 09:44:00,148 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-09 09:44:00,148 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-09 09:44:00,148 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-09 09:44:00,149 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-09 09:44:00,149 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-09 09:44:00,149 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-09 09:44:00,149 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-09 09:44:00,149 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-09 09:44:00,149 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-09 09:44:00,149 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-09 09:44:00,149 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-09 09:44:00,149 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-09 09:44:00,149 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-09 09:44:00,149 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-09 09:44:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-09 09:44:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-09 09:44:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-09 09:44:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-09 09:44:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-09 09:44:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-09 09:44:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-09 09:44:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-09 09:44:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-09 09:44:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-09 09:44:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-09 09:44:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-09 09:44:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-09 09:44:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-09 09:44:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-09 09:44:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-09 09:44:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-09 09:44:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-09 09:44:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-09 09:44:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-09 09:44:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-09 09:44:00,152 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-09 09:44:00,152 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-09 09:44:00,152 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-09 09:44:00,152 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-09 09:44:00,152 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-09 09:44:00,152 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-09 09:44:00,152 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-09 09:44:00,152 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-09 09:44:00,152 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 09:44:00,152 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-09 09:44:00,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 09:44:00,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 09:44:00,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 09:44:00,153 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-12-09 09:44:00,153 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2018-12-09 09:44:00,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 09:44:00,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 09:44:00,153 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2018-12-09 09:44:00,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 09:44:00,153 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2018-12-09 09:44:00,153 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 09:44:00,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 09:44:00,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:44:00,420 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:44:00,420 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-09 09:44:00,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:44:00 BoogieIcfgContainer [2018-12-09 09:44:00,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:44:00,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 09:44:00,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 09:44:00,423 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 09:44:00,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:43:59" (1/3) ... [2018-12-09 09:44:00,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@164a92ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:44:00, skipping insertion in model container [2018-12-09 09:44:00,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:44:00" (2/3) ... [2018-12-09 09:44:00,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@164a92ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:44:00, skipping insertion in model container [2018-12-09 09:44:00,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:44:00" (3/3) ... [2018-12-09 09:44:00,425 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-09 09:44:00,432 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 09:44:00,437 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2018-12-09 09:44:00,446 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2018-12-09 09:44:00,461 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 09:44:00,462 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 09:44:00,462 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 09:44:00,462 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 09:44:00,462 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:44:00,462 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:44:00,462 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 09:44:00,463 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:44:00,463 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 09:44:00,473 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2018-12-09 09:44:00,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 09:44:00,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:00,480 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:00,481 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:00,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:00,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1843482384, now seen corresponding path program 1 times [2018-12-09 09:44:00,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:00,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:00,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:00,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:00,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:00,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:44:00,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:44:00,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 09:44:00,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:44:00,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:44:00,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:44:00,601 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 3 states. [2018-12-09 09:44:00,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:44:00,672 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-12-09 09:44:00,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:44:00,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-09 09:44:00,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:44:00,679 INFO L225 Difference]: With dead ends: 106 [2018-12-09 09:44:00,679 INFO L226 Difference]: Without dead ends: 99 [2018-12-09 09:44:00,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:44:00,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-09 09:44:00,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-09 09:44:00,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-09 09:44:00,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-12-09 09:44:00,707 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 12 [2018-12-09 09:44:00,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:44:00,707 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-12-09 09:44:00,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:44:00,707 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-12-09 09:44:00,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 09:44:00,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:00,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:00,708 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:00,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:00,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1843482383, now seen corresponding path program 1 times [2018-12-09 09:44:00,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:00,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:00,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:00,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:00,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:44:00,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:44:00,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 09:44:00,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:44:00,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:44:00,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:44:00,759 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 3 states. [2018-12-09 09:44:00,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:44:00,793 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2018-12-09 09:44:00,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:44:00,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-09 09:44:00,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:44:00,795 INFO L225 Difference]: With dead ends: 96 [2018-12-09 09:44:00,795 INFO L226 Difference]: Without dead ends: 96 [2018-12-09 09:44:00,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:44:00,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-09 09:44:00,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-09 09:44:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-09 09:44:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-12-09 09:44:00,801 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 12 [2018-12-09 09:44:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:44:00,801 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-12-09 09:44:00,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:44:00,801 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-12-09 09:44:00,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 09:44:00,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:00,802 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:00,802 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:00,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:00,802 INFO L82 PathProgramCache]: Analyzing trace with hash 92083562, now seen corresponding path program 1 times [2018-12-09 09:44:00,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:00,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:00,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:00,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:00,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:00,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:44:00,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:44:00,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:44:00,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:44:00,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:44:00,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:44:00,841 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 5 states. [2018-12-09 09:44:00,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:44:00,875 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-12-09 09:44:00,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:44:00,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-09 09:44:00,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:44:00,877 INFO L225 Difference]: With dead ends: 97 [2018-12-09 09:44:00,877 INFO L226 Difference]: Without dead ends: 97 [2018-12-09 09:44:00,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:44:00,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-09 09:44:00,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-09 09:44:00,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 09:44:00,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-12-09 09:44:00,884 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 20 [2018-12-09 09:44:00,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:44:00,886 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-12-09 09:44:00,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:44:00,886 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-12-09 09:44:00,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 09:44:00,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:00,887 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:00,887 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:00,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:00,888 INFO L82 PathProgramCache]: Analyzing trace with hash -612607148, now seen corresponding path program 1 times [2018-12-09 09:44:00,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:00,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:00,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:00,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:00,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 09:44:00,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:44:00,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:44:00,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:44:00,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:44:00,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:44:00,980 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 6 states. [2018-12-09 09:44:01,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:44:01,074 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2018-12-09 09:44:01,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:44:01,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-09 09:44:01,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:44:01,076 INFO L225 Difference]: With dead ends: 97 [2018-12-09 09:44:01,076 INFO L226 Difference]: Without dead ends: 97 [2018-12-09 09:44:01,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:44:01,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-09 09:44:01,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-12-09 09:44:01,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-09 09:44:01,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-12-09 09:44:01,083 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 30 [2018-12-09 09:44:01,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:44:01,083 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-12-09 09:44:01,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:44:01,083 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-12-09 09:44:01,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 09:44:01,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:01,084 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:01,084 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:01,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:01,085 INFO L82 PathProgramCache]: Analyzing trace with hash -612607149, now seen corresponding path program 1 times [2018-12-09 09:44:01,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:01,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:01,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:01,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:01,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:01,126 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 09:44:01,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:44:01,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:44:01,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:44:01,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:44:01,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:44:01,127 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 6 states. [2018-12-09 09:44:01,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:44:01,216 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2018-12-09 09:44:01,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:44:01,216 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-09 09:44:01,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:44:01,217 INFO L225 Difference]: With dead ends: 96 [2018-12-09 09:44:01,217 INFO L226 Difference]: Without dead ends: 96 [2018-12-09 09:44:01,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:44:01,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-09 09:44:01,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-12-09 09:44:01,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-09 09:44:01,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-12-09 09:44:01,221 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 30 [2018-12-09 09:44:01,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:44:01,221 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-12-09 09:44:01,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:44:01,221 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-12-09 09:44:01,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 09:44:01,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:01,222 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:01,222 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:01,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:01,222 INFO L82 PathProgramCache]: Analyzing trace with hash -304950988, now seen corresponding path program 1 times [2018-12-09 09:44:01,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:01,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:01,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:01,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:01,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:01,349 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:44:01,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:44:01,349 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:44:01,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:01,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:44:02,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 09:44:02,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:02,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:44:02,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-09 09:44:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:44:02,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:44:02,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-12-09 09:44:02,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 09:44:02,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 09:44:02,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=96, Unknown=4, NotChecked=0, Total=132 [2018-12-09 09:44:02,963 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 12 states. [2018-12-09 09:44:03,378 WARN L180 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-09 09:44:03,642 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-09 09:44:03,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:44:03,881 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2018-12-09 09:44:03,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:44:03,881 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-12-09 09:44:03,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:44:03,882 INFO L225 Difference]: With dead ends: 132 [2018-12-09 09:44:03,882 INFO L226 Difference]: Without dead ends: 132 [2018-12-09 09:44:03,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=58, Invalid=178, Unknown=4, NotChecked=0, Total=240 [2018-12-09 09:44:03,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-09 09:44:03,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 100. [2018-12-09 09:44:03,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-09 09:44:03,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2018-12-09 09:44:03,894 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 32 [2018-12-09 09:44:03,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:44:03,894 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2018-12-09 09:44:03,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 09:44:03,894 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-12-09 09:44:03,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 09:44:03,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:03,895 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:03,895 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:03,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:03,897 INFO L82 PathProgramCache]: Analyzing trace with hash -304950987, now seen corresponding path program 1 times [2018-12-09 09:44:03,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:03,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:03,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:03,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:03,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:04,002 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:44:04,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:44:04,002 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:44:04,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:04,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:44:04,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 09:44:04,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:04,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:04,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 09:44:04,320 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.base Int)) (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base 12))) is different from true [2018-12-09 09:44:04,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 09:44:04,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:04,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:44:04,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-09 09:44:04,337 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-12-09 09:44:04,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:44:04,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2018-12-09 09:44:04,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 09:44:04,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 09:44:04,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=56, Unknown=1, NotChecked=14, Total=90 [2018-12-09 09:44:04,352 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 10 states. [2018-12-09 09:44:04,860 WARN L180 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2018-12-09 09:44:05,390 WARN L180 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2018-12-09 09:44:05,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:44:05,595 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-12-09 09:44:05,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:44:05,595 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-12-09 09:44:05,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:44:05,596 INFO L225 Difference]: With dead ends: 101 [2018-12-09 09:44:05,596 INFO L226 Difference]: Without dead ends: 101 [2018-12-09 09:44:05,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=39, Invalid=120, Unknown=1, NotChecked=22, Total=182 [2018-12-09 09:44:05,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-09 09:44:05,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-12-09 09:44:05,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-09 09:44:05,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-12-09 09:44:05,599 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 32 [2018-12-09 09:44:05,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:44:05,599 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-12-09 09:44:05,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 09:44:05,599 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-12-09 09:44:05,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 09:44:05,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:05,600 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:05,600 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:05,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:05,600 INFO L82 PathProgramCache]: Analyzing trace with hash -999969269, now seen corresponding path program 1 times [2018-12-09 09:44:05,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:05,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:05,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:05,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:05,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:05,644 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 09:44:05,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:44:05,644 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:44:05,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:05,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:44:05,693 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 09:44:05,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:44:05,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 8 [2018-12-09 09:44:05,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:44:05,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:44:05,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:44:05,709 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 8 states. [2018-12-09 09:44:05,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:44:05,753 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-12-09 09:44:05,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:44:05,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-12-09 09:44:05,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:44:05,754 INFO L225 Difference]: With dead ends: 101 [2018-12-09 09:44:05,754 INFO L226 Difference]: Without dead ends: 101 [2018-12-09 09:44:05,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:44:05,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-09 09:44:05,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-12-09 09:44:05,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-09 09:44:05,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2018-12-09 09:44:05,758 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 34 [2018-12-09 09:44:05,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:44:05,758 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2018-12-09 09:44:05,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:44:05,759 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2018-12-09 09:44:05,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 09:44:05,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:05,759 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:05,760 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:05,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:05,760 INFO L82 PathProgramCache]: Analyzing trace with hash -939056962, now seen corresponding path program 1 times [2018-12-09 09:44:05,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:05,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:05,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:05,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:05,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:05,839 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 09:44:05,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:44:05,839 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:44:05,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:05,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:44:05,891 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 09:44:05,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:44:05,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-09 09:44:05,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 09:44:05,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 09:44:05,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:44:05,907 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand 9 states. [2018-12-09 09:44:05,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:44:05,999 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2018-12-09 09:44:06,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:44:06,000 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-12-09 09:44:06,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:44:06,001 INFO L225 Difference]: With dead ends: 111 [2018-12-09 09:44:06,001 INFO L226 Difference]: Without dead ends: 111 [2018-12-09 09:44:06,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-09 09:44:06,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-09 09:44:06,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 103. [2018-12-09 09:44:06,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-09 09:44:06,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-12-09 09:44:06,005 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 35 [2018-12-09 09:44:06,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:44:06,005 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-12-09 09:44:06,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 09:44:06,005 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-12-09 09:44:06,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 09:44:06,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:06,006 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:06,006 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:06,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:06,006 INFO L82 PathProgramCache]: Analyzing trace with hash -939056963, now seen corresponding path program 1 times [2018-12-09 09:44:06,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:06,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:06,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:06,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:06,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:06,037 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 09:44:06,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:44:06,037 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:44:06,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:06,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:44:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 09:44:06,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:44:06,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-12-09 09:44:06,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:44:06,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:44:06,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:44:06,101 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 5 states. [2018-12-09 09:44:06,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:44:06,175 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-12-09 09:44:06,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:44:06,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-12-09 09:44:06,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:44:06,176 INFO L225 Difference]: With dead ends: 104 [2018-12-09 09:44:06,176 INFO L226 Difference]: Without dead ends: 104 [2018-12-09 09:44:06,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:44:06,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-09 09:44:06,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-12-09 09:44:06,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-09 09:44:06,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2018-12-09 09:44:06,180 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 35 [2018-12-09 09:44:06,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:44:06,180 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2018-12-09 09:44:06,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:44:06,180 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2018-12-09 09:44:06,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 09:44:06,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:06,181 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:06,181 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:06,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:06,182 INFO L82 PathProgramCache]: Analyzing trace with hash 954005222, now seen corresponding path program 1 times [2018-12-09 09:44:06,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:06,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:06,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:06,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:06,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:06,220 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 09:44:06,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:44:06,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:44:06,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:44:06,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:44:06,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:44:06,221 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand 7 states. [2018-12-09 09:44:06,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:44:06,324 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-12-09 09:44:06,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:44:06,324 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-12-09 09:44:06,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:44:06,325 INFO L225 Difference]: With dead ends: 103 [2018-12-09 09:44:06,325 INFO L226 Difference]: Without dead ends: 103 [2018-12-09 09:44:06,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:44:06,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-09 09:44:06,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-12-09 09:44:06,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-09 09:44:06,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-12-09 09:44:06,328 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 36 [2018-12-09 09:44:06,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:44:06,328 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-12-09 09:44:06,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:44:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-12-09 09:44:06,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 09:44:06,329 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:06,329 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:06,329 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:06,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:06,329 INFO L82 PathProgramCache]: Analyzing trace with hash 954005223, now seen corresponding path program 1 times [2018-12-09 09:44:06,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:06,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:06,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:06,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:06,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:06,376 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 09:44:06,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:44:06,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:44:06,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:44:06,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:44:06,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:44:06,376 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 7 states. [2018-12-09 09:44:06,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:44:06,479 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-12-09 09:44:06,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:44:06,479 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-12-09 09:44:06,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:44:06,480 INFO L225 Difference]: With dead ends: 101 [2018-12-09 09:44:06,480 INFO L226 Difference]: Without dead ends: 101 [2018-12-09 09:44:06,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:44:06,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-09 09:44:06,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-09 09:44:06,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-09 09:44:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2018-12-09 09:44:06,483 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 36 [2018-12-09 09:44:06,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:44:06,484 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2018-12-09 09:44:06,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:44:06,484 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2018-12-09 09:44:06,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 09:44:06,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:06,485 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:06,485 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:06,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:06,485 INFO L82 PathProgramCache]: Analyzing trace with hash 208022194, now seen corresponding path program 1 times [2018-12-09 09:44:06,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:06,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:06,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:06,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:06,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:06,579 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 09:44:06,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:44:06,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 09:44:06,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 09:44:06,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 09:44:06,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:44:06,580 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand 12 states. [2018-12-09 09:44:06,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:44:06,817 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2018-12-09 09:44:06,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 09:44:06,817 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-12-09 09:44:06,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:44:06,818 INFO L225 Difference]: With dead ends: 107 [2018-12-09 09:44:06,818 INFO L226 Difference]: Without dead ends: 107 [2018-12-09 09:44:06,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-09 09:44:06,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-09 09:44:06,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-12-09 09:44:06,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-09 09:44:06,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2018-12-09 09:44:06,821 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 45 [2018-12-09 09:44:06,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:44:06,821 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2018-12-09 09:44:06,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 09:44:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2018-12-09 09:44:06,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 09:44:06,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:06,822 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:06,823 INFO L423 AbstractCegarLoop]: === Iteration 14 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:06,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:06,823 INFO L82 PathProgramCache]: Analyzing trace with hash 208022195, now seen corresponding path program 1 times [2018-12-09 09:44:06,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:06,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:06,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:06,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:06,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:06,863 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 09:44:06,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:44:06,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:44:06,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:44:06,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:44:06,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:44:06,864 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand 6 states. [2018-12-09 09:44:06,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:44:06,896 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2018-12-09 09:44:06,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:44:06,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-12-09 09:44:06,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:44:06,897 INFO L225 Difference]: With dead ends: 125 [2018-12-09 09:44:06,897 INFO L226 Difference]: Without dead ends: 125 [2018-12-09 09:44:06,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:44:06,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-09 09:44:06,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 116. [2018-12-09 09:44:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-09 09:44:06,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2018-12-09 09:44:06,900 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 45 [2018-12-09 09:44:06,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:44:06,900 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2018-12-09 09:44:06,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:44:06,900 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2018-12-09 09:44:06,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 09:44:06,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:06,901 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:06,901 INFO L423 AbstractCegarLoop]: === Iteration 15 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:06,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:06,901 INFO L82 PathProgramCache]: Analyzing trace with hash 208022250, now seen corresponding path program 1 times [2018-12-09 09:44:06,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:06,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:06,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:06,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:06,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:07,013 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 09:44:07,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:44:07,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 09:44:07,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 09:44:07,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 09:44:07,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:44:07,014 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. Second operand 12 states. [2018-12-09 09:44:07,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:44:07,229 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2018-12-09 09:44:07,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 09:44:07,230 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-12-09 09:44:07,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:44:07,230 INFO L225 Difference]: With dead ends: 120 [2018-12-09 09:44:07,230 INFO L226 Difference]: Without dead ends: 120 [2018-12-09 09:44:07,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-09 09:44:07,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-09 09:44:07,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2018-12-09 09:44:07,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-09 09:44:07,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 132 transitions. [2018-12-09 09:44:07,233 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 132 transitions. Word has length 45 [2018-12-09 09:44:07,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:44:07,233 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 132 transitions. [2018-12-09 09:44:07,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 09:44:07,233 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 132 transitions. [2018-12-09 09:44:07,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 09:44:07,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:07,233 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:07,234 INFO L423 AbstractCegarLoop]: === Iteration 16 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:07,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:07,234 INFO L82 PathProgramCache]: Analyzing trace with hash 362970760, now seen corresponding path program 1 times [2018-12-09 09:44:07,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:07,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:07,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:07,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:07,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:07,265 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 09:44:07,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:44:07,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:44:07,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:44:07,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:44:07,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:44:07,266 INFO L87 Difference]: Start difference. First operand 116 states and 132 transitions. Second operand 6 states. [2018-12-09 09:44:07,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:44:07,293 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2018-12-09 09:44:07,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:44:07,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-12-09 09:44:07,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:44:07,294 INFO L225 Difference]: With dead ends: 104 [2018-12-09 09:44:07,295 INFO L226 Difference]: Without dead ends: 104 [2018-12-09 09:44:07,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:44:07,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-09 09:44:07,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-09 09:44:07,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-09 09:44:07,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-12-09 09:44:07,298 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 47 [2018-12-09 09:44:07,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:44:07,298 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-12-09 09:44:07,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:44:07,298 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-12-09 09:44:07,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 09:44:07,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:07,298 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:07,298 INFO L423 AbstractCegarLoop]: === Iteration 17 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:07,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:07,299 INFO L82 PathProgramCache]: Analyzing trace with hash -446967498, now seen corresponding path program 1 times [2018-12-09 09:44:07,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:07,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:07,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:07,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:07,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:07,564 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:44:07,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:44:07,564 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:44:07,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:07,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:44:07,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:07,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:07,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 09:44:07,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:07,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:07,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-09 09:44:07,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:44:07,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 09:44:07,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:07,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:07,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:07,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-09 09:44:07,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-09 09:44:07,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:44:07,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:07,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:07,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:44:07,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 09:44:07,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-09 09:44:07,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-12-09 09:44:07,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:07,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:07,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 09:44:07,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-12-09 09:44:09,844 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-12-09 09:44:09,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2018-12-09 09:44:09,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:09,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 50 [2018-12-09 09:44:09,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:09,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:09,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:44:09,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2018-12-09 09:44:10,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2018-12-09 09:44:10,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 09:44:10,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:10,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:10,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-12-09 09:44:10,151 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:10,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:10,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:10,167 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:5 [2018-12-09 09:44:10,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:44:10,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:44:10,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 36 [2018-12-09 09:44:10,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-09 09:44:10,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-09 09:44:10,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1242, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 09:44:10,233 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 37 states. [2018-12-09 09:44:12,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:44:12,187 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2018-12-09 09:44:12,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 09:44:12,187 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 48 [2018-12-09 09:44:12,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:44:12,187 INFO L225 Difference]: With dead ends: 129 [2018-12-09 09:44:12,187 INFO L226 Difference]: Without dead ends: 129 [2018-12-09 09:44:12,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=204, Invalid=2346, Unknown=0, NotChecked=0, Total=2550 [2018-12-09 09:44:12,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-09 09:44:12,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2018-12-09 09:44:12,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-09 09:44:12,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2018-12-09 09:44:12,190 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 48 [2018-12-09 09:44:12,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:44:12,190 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2018-12-09 09:44:12,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-09 09:44:12,190 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2018-12-09 09:44:12,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 09:44:12,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:12,191 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:12,191 INFO L423 AbstractCegarLoop]: === Iteration 18 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:12,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:12,191 INFO L82 PathProgramCache]: Analyzing trace with hash -446967497, now seen corresponding path program 1 times [2018-12-09 09:44:12,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:12,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:12,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:12,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:12,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:12,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:44:12,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:44:12,614 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:44:12,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:12,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:44:13,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:13,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 09:44:13,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:13,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:13,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:13,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 09:44:13,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:13,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:13,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-12-09 09:44:13,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:44:13,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 09:44:13,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:13,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:13,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:44:13,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 09:44:13,240 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:13,242 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:13,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:13,252 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2018-12-09 09:44:13,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-09 09:44:13,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:44:13,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:13,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:13,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 32 [2018-12-09 09:44:13,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-09 09:44:13,371 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:13,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:13,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:13,388 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:65 [2018-12-09 09:44:13,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 64 [2018-12-09 09:44:13,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:13,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 57 [2018-12-09 09:44:13,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:13,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:13,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 54 [2018-12-09 09:44:13,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:13,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-12-09 09:44:13,558 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:13,563 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:13,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:13,575 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:111, output treesize:95 [2018-12-09 09:44:13,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:13,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 105 [2018-12-09 09:44:13,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:13,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 137 [2018-12-09 09:44:13,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:13,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:13,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 75 [2018-12-09 09:44:13,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:13,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 43 [2018-12-09 09:44:13,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:13,693 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:13,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:44:13,711 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:146, output treesize:152 [2018-12-09 09:44:14,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:14,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 109 [2018-12-09 09:44:14,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:14,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 34 [2018-12-09 09:44:14,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:14,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:14,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2018-12-09 09:44:14,087 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:14,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:14,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-12-09 09:44:14,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:14,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-09 09:44:14,112 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:14,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:14,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-09 09:44:14,118 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:14,120 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:14,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:44:14,128 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:166, output treesize:23 [2018-12-09 09:44:14,219 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:44:14,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:44:14,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2018-12-09 09:44:14,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-09 09:44:14,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-09 09:44:14,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1862, Unknown=0, NotChecked=0, Total=1980 [2018-12-09 09:44:14,235 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand 45 states. [2018-12-09 09:44:16,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:44:16,423 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2018-12-09 09:44:16,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 09:44:16,424 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 48 [2018-12-09 09:44:16,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:44:16,424 INFO L225 Difference]: With dead ends: 130 [2018-12-09 09:44:16,425 INFO L226 Difference]: Without dead ends: 130 [2018-12-09 09:44:16,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=258, Invalid=3402, Unknown=0, NotChecked=0, Total=3660 [2018-12-09 09:44:16,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-09 09:44:16,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 108. [2018-12-09 09:44:16,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-09 09:44:16,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2018-12-09 09:44:16,428 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 48 [2018-12-09 09:44:16,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:44:16,429 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2018-12-09 09:44:16,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-09 09:44:16,429 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2018-12-09 09:44:16,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 09:44:16,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:16,430 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:16,430 INFO L423 AbstractCegarLoop]: === Iteration 19 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:16,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:16,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1208456142, now seen corresponding path program 2 times [2018-12-09 09:44:16,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:16,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:16,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:16,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:16,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:16,458 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 09:44:16,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:44:16,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:44:16,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:44:16,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:44:16,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:44:16,459 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 7 states. [2018-12-09 09:44:16,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:44:16,487 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2018-12-09 09:44:16,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:44:16,487 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-12-09 09:44:16,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:44:16,487 INFO L225 Difference]: With dead ends: 100 [2018-12-09 09:44:16,488 INFO L226 Difference]: Without dead ends: 100 [2018-12-09 09:44:16,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:44:16,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-09 09:44:16,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-09 09:44:16,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-09 09:44:16,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-12-09 09:44:16,489 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 51 [2018-12-09 09:44:16,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:44:16,490 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-12-09 09:44:16,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:44:16,490 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-12-09 09:44:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 09:44:16,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:16,490 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:16,490 INFO L423 AbstractCegarLoop]: === Iteration 20 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:16,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:16,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1664125494, now seen corresponding path program 1 times [2018-12-09 09:44:16,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:16,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:16,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:16,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:44:16,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 09:44:16,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:44:16,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 09:44:16,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 09:44:16,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 09:44:16,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:44:16,556 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 12 states. [2018-12-09 09:44:16,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:44:16,724 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2018-12-09 09:44:16,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 09:44:16,724 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-12-09 09:44:16,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:44:16,725 INFO L225 Difference]: With dead ends: 105 [2018-12-09 09:44:16,725 INFO L226 Difference]: Without dead ends: 105 [2018-12-09 09:44:16,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-09 09:44:16,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-09 09:44:16,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-12-09 09:44:16,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-09 09:44:16,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2018-12-09 09:44:16,727 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 58 [2018-12-09 09:44:16,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:44:16,727 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2018-12-09 09:44:16,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 09:44:16,727 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2018-12-09 09:44:16,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 09:44:16,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:16,727 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:16,727 INFO L423 AbstractCegarLoop]: === Iteration 21 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:16,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:16,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1664125493, now seen corresponding path program 1 times [2018-12-09 09:44:16,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:16,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:16,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:16,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:16,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 09:44:16,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:44:16,748 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:44:16,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:16,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:44:16,793 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 09:44:16,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:44:16,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-12-09 09:44:16,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:44:16,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:44:16,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:44:16,810 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand 5 states. [2018-12-09 09:44:16,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:44:16,835 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2018-12-09 09:44:16,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:44:16,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-12-09 09:44:16,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:44:16,836 INFO L225 Difference]: With dead ends: 110 [2018-12-09 09:44:16,836 INFO L226 Difference]: Without dead ends: 110 [2018-12-09 09:44:16,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:44:16,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-09 09:44:16,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-09 09:44:16,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-09 09:44:16,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2018-12-09 09:44:16,839 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 58 [2018-12-09 09:44:16,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:44:16,840 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2018-12-09 09:44:16,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:44:16,840 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2018-12-09 09:44:16,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 09:44:16,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:16,840 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:16,840 INFO L423 AbstractCegarLoop]: === Iteration 22 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:16,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:16,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1612389058, now seen corresponding path program 1 times [2018-12-09 09:44:16,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:16,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:16,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:16,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:16,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:16,873 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 09:44:16,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:44:16,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:44:16,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:44:16,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:44:16,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:44:16,874 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 7 states. [2018-12-09 09:44:16,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:44:16,917 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-12-09 09:44:16,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:44:16,918 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2018-12-09 09:44:16,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:44:16,918 INFO L225 Difference]: With dead ends: 104 [2018-12-09 09:44:16,918 INFO L226 Difference]: Without dead ends: 104 [2018-12-09 09:44:16,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:44:16,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-09 09:44:16,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-09 09:44:16,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-09 09:44:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2018-12-09 09:44:16,921 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 59 [2018-12-09 09:44:16,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:44:16,922 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2018-12-09 09:44:16,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:44:16,922 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2018-12-09 09:44:16,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 09:44:16,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:16,922 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:16,923 INFO L423 AbstractCegarLoop]: === Iteration 23 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:16,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:16,923 INFO L82 PathProgramCache]: Analyzing trace with hash -2144929985, now seen corresponding path program 2 times [2018-12-09 09:44:16,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:16,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:16,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:16,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:16,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:16,969 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 09:44:16,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:44:16,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:44:16,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:44:16,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:44:16,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:44:16,970 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 6 states. [2018-12-09 09:44:17,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:44:17,002 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2018-12-09 09:44:17,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:44:17,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-09 09:44:17,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:44:17,003 INFO L225 Difference]: With dead ends: 118 [2018-12-09 09:44:17,003 INFO L226 Difference]: Without dead ends: 118 [2018-12-09 09:44:17,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:44:17,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-09 09:44:17,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2018-12-09 09:44:17,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-09 09:44:17,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2018-12-09 09:44:17,006 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 66 [2018-12-09 09:44:17,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:44:17,006 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2018-12-09 09:44:17,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:44:17,006 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2018-12-09 09:44:17,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 09:44:17,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:17,007 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:17,007 INFO L423 AbstractCegarLoop]: === Iteration 24 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:17,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:17,007 INFO L82 PathProgramCache]: Analyzing trace with hash -2144929930, now seen corresponding path program 1 times [2018-12-09 09:44:17,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:17,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:17,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:17,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:44:17,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:17,122 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 09:44:17,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:44:17,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 09:44:17,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 09:44:17,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 09:44:17,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:44:17,123 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand 12 states. [2018-12-09 09:44:17,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:44:17,321 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2018-12-09 09:44:17,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 09:44:17,321 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-12-09 09:44:17,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:44:17,322 INFO L225 Difference]: With dead ends: 119 [2018-12-09 09:44:17,322 INFO L226 Difference]: Without dead ends: 119 [2018-12-09 09:44:17,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-09 09:44:17,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-09 09:44:17,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2018-12-09 09:44:17,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-09 09:44:17,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2018-12-09 09:44:17,324 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 66 [2018-12-09 09:44:17,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:44:17,324 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2018-12-09 09:44:17,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 09:44:17,324 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2018-12-09 09:44:17,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 09:44:17,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:17,325 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:17,325 INFO L423 AbstractCegarLoop]: === Iteration 25 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:17,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:17,325 INFO L82 PathProgramCache]: Analyzing trace with hash 915903942, now seen corresponding path program 1 times [2018-12-09 09:44:17,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:17,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:17,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:17,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:17,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:17,784 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 09:44:17,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:44:17,784 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:44:17,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:17,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:44:17,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:17,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:17,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 09:44:17,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:17,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:17,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-09 09:44:17,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:44:17,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 09:44:17,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:17,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:17,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:17,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-09 09:44:17,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-09 09:44:17,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:44:17,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:17,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:17,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:44:17,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 09:44:18,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-09 09:44:18,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-12-09 09:44:18,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:18,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:18,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 09:44:18,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-12-09 09:44:18,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-12-09 09:44:18,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:18,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-12-09 09:44:18,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:18,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:18,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:44:18,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-12-09 09:44:18,968 WARN L180 SmtUtils]: Spent 674.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-09 09:44:18,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2018-12-09 09:44:18,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2018-12-09 09:44:18,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 09:44:18,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:44:19,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 09:44:19,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:78 [2018-12-09 09:44:19,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-12-09 09:44:19,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:19,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-09 09:44:19,056 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:44:19,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:44:19,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:44:19,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2018-12-09 09:44:27,209 WARN L180 SmtUtils]: Spent 429.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-09 09:44:27,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2018-12-09 09:44:27,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:27,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:27,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:27,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 51 [2018-12-09 09:44:27,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:27,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:27,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:44:27,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:36 [2018-12-09 09:44:27,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2018-12-09 09:44:27,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:27,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-12-09 09:44:27,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:27,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:27,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:27,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2018-12-09 09:44:27,356 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 09:44:27,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:44:27,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 50 [2018-12-09 09:44:27,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-09 09:44:27,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-09 09:44:27,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2390, Unknown=17, NotChecked=0, Total=2550 [2018-12-09 09:44:27,372 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand 51 states. [2018-12-09 09:44:39,299 WARN L180 SmtUtils]: Spent 740.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-09 09:44:41,887 WARN L180 SmtUtils]: Spent 435.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-09 09:44:45,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:44:45,241 INFO L93 Difference]: Finished difference Result 146 states and 161 transitions. [2018-12-09 09:44:45,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-09 09:44:45,241 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 69 [2018-12-09 09:44:45,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:44:45,241 INFO L225 Difference]: With dead ends: 146 [2018-12-09 09:44:45,241 INFO L226 Difference]: Without dead ends: 146 [2018-12-09 09:44:45,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 42 SyntacticMatches, 10 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=416, Invalid=5267, Unknown=17, NotChecked=0, Total=5700 [2018-12-09 09:44:45,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-09 09:44:45,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2018-12-09 09:44:45,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-09 09:44:45,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 139 transitions. [2018-12-09 09:44:45,244 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 139 transitions. Word has length 69 [2018-12-09 09:44:45,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:44:45,244 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 139 transitions. [2018-12-09 09:44:45,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-09 09:44:45,244 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 139 transitions. [2018-12-09 09:44:45,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 09:44:45,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:44:45,245 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:44:45,245 INFO L423 AbstractCegarLoop]: === Iteration 26 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:44:45,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:44:45,245 INFO L82 PathProgramCache]: Analyzing trace with hash 915903943, now seen corresponding path program 1 times [2018-12-09 09:44:45,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:44:45,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:44:45,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:45,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:45,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:44:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:45,805 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:44:45,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:44:45,805 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:44:45,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:44:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:44:45,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:44:45,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:45,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:45,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 09:44:45,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:45,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:45,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-09 09:44:45,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:44:45,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 09:44:45,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:45,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:45,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:45,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-09 09:44:45,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-09 09:44:45,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:44:45,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:45,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:45,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:44:45,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 09:44:46,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-09 09:44:46,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-12-09 09:44:46,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:46,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:46,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:44:46,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-12-09 09:44:48,097 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-09 09:44:48,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-12-09 09:44:48,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:48,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 52 [2018-12-09 09:44:48,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:48,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:48,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 09:44:48,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:44:48,123 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:48,124 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:48,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:44:48,129 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:52 [2018-12-09 09:44:50,168 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-09 09:44:52,213 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-09 09:44:54,257 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-09 09:44:56,307 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-09 09:44:56,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 123 [2018-12-09 09:44:56,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-09 09:44:56,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:56,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:56,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 92 [2018-12-09 09:44:56,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 96 [2018-12-09 09:44:56,523 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-12-09 09:44:56,546 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-09 09:44:56,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-09 09:44:56,576 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:154, output treesize:283 [2018-12-09 09:44:56,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2018-12-09 09:44:56,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:56,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:56,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 32 [2018-12-09 09:44:56,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:56,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:56,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 65 [2018-12-09 09:44:56,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:56,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2018-12-09 09:44:56,708 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:44:56,716 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:44:56,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:56,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2018-12-09 09:44:56,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:56,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-12-09 09:44:56,747 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:44:56,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 09:44:56,757 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:56,761 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:44:56,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-12-09 09:44:56,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:56,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-09 09:44:56,775 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:44:56,779 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:44:56,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 09:44:56,789 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:139, output treesize:25 [2018-12-09 09:44:57,600 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_44 Int)) (<= 4 (select |c_#length| v_arrayElimCell_44))) (exists ((dll_circular_update_at_~head.offset Int)) (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_dll_circular_update_at_#in~head.base|) .cse0)))) (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))))) is different from true [2018-12-09 09:44:57,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 96 [2018-12-09 09:44:57,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:57,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:57,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:57,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 57 [2018-12-09 09:44:57,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:57,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:57,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 102 [2018-12-09 09:44:57,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:57,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:57,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:57,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 64 [2018-12-09 09:44:57,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:57,697 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:57,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 77 [2018-12-09 09:44:57,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:57,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:57,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:57,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:57,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 74 [2018-12-09 09:44:57,735 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:57,747 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:57,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:57,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 88 [2018-12-09 09:44:57,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:57,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:57,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:57,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 84 [2018-12-09 09:44:57,781 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:57,793 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:57,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 09:44:57,812 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:219, output treesize:135 [2018-12-09 09:44:58,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2018-12-09 09:44:58,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:58,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2018-12-09 09:44:58,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:58,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:58,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2018-12-09 09:44:58,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:58,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:58,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-12-09 09:44:58,042 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:58,045 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:58,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2018-12-09 09:44:58,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:58,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-12-09 09:44:58,061 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:44:58,067 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:44:58,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:58,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 53 [2018-12-09 09:44:58,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:44:58,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2018-12-09 09:44:58,083 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:58,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 09:44:58,089 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 09:44:58,092 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:58,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:44:58,104 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:155, output treesize:13 [2018-12-09 09:44:58,116 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-12-09 09:44:58,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:44:58,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 53 [2018-12-09 09:44:58,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-09 09:44:58,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-09 09:44:58,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2615, Unknown=1, NotChecked=102, Total=2862 [2018-12-09 09:44:58,132 INFO L87 Difference]: Start difference. First operand 122 states and 139 transitions. Second operand 54 states. [2018-12-09 09:45:04,187 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-09 09:45:08,274 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2018-12-09 09:45:15,372 WARN L180 SmtUtils]: Spent 7.05 s on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2018-12-09 09:45:19,427 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-12-09 09:45:23,478 WARN L180 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-12-09 09:45:29,807 WARN L180 SmtUtils]: Spent 5.81 s on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2018-12-09 09:45:30,688 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2018-12-09 09:45:31,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:45:31,105 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2018-12-09 09:45:31,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-09 09:45:31,105 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 69 [2018-12-09 09:45:31,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:45:31,106 INFO L225 Difference]: With dead ends: 143 [2018-12-09 09:45:31,106 INFO L226 Difference]: Without dead ends: 143 [2018-12-09 09:45:31,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 42.9s TimeCoverageRelationStatistics Valid=398, Invalid=5767, Unknown=1, NotChecked=154, Total=6320 [2018-12-09 09:45:31,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-09 09:45:31,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 121. [2018-12-09 09:45:31,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-09 09:45:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2018-12-09 09:45:31,109 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 69 [2018-12-09 09:45:31,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:45:31,109 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2018-12-09 09:45:31,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-09 09:45:31,109 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2018-12-09 09:45:31,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 09:45:31,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:45:31,110 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:45:31,110 INFO L423 AbstractCegarLoop]: === Iteration 27 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:45:31,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:45:31,110 INFO L82 PathProgramCache]: Analyzing trace with hash 915903998, now seen corresponding path program 1 times [2018-12-09 09:45:31,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:45:31,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:45:31,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:31,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:45:31,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:45:31,147 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 09:45:31,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:45:31,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:45:31,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:45:31,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:45:31,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:45:31,148 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand 7 states. [2018-12-09 09:45:31,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:45:31,181 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-12-09 09:45:31,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:45:31,182 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-12-09 09:45:31,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:45:31,182 INFO L225 Difference]: With dead ends: 107 [2018-12-09 09:45:31,182 INFO L226 Difference]: Without dead ends: 107 [2018-12-09 09:45:31,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:45:31,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-09 09:45:31,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-09 09:45:31,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 09:45:31,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-12-09 09:45:31,185 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 69 [2018-12-09 09:45:31,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:45:31,185 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-12-09 09:45:31,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:45:31,185 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-12-09 09:45:31,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 09:45:31,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:45:31,186 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:45:31,186 INFO L423 AbstractCegarLoop]: === Iteration 28 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:45:31,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:45:31,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1144526287, now seen corresponding path program 1 times [2018-12-09 09:45:31,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:45:31,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:45:31,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:31,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:45:31,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:45:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-09 09:45:31,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:45:31,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 09:45:31,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 09:45:31,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 09:45:31,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:45:31,257 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 12 states. [2018-12-09 09:45:31,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:45:31,461 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2018-12-09 09:45:31,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 09:45:31,461 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2018-12-09 09:45:31,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:45:31,462 INFO L225 Difference]: With dead ends: 123 [2018-12-09 09:45:31,462 INFO L226 Difference]: Without dead ends: 123 [2018-12-09 09:45:31,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-09 09:45:31,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-09 09:45:31,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2018-12-09 09:45:31,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-09 09:45:31,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-12-09 09:45:31,464 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 91 [2018-12-09 09:45:31,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:45:31,465 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-12-09 09:45:31,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 09:45:31,465 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-12-09 09:45:31,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 09:45:31,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:45:31,466 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:45:31,466 INFO L423 AbstractCegarLoop]: === Iteration 29 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:45:31,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:45:31,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1144526288, now seen corresponding path program 1 times [2018-12-09 09:45:31,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:45:31,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:45:31,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:31,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:45:31,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:45:31,579 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-09 09:45:31,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:45:31,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 09:45:31,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 09:45:31,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 09:45:31,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:45:31,580 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 12 states. [2018-12-09 09:45:31,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:45:31,751 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-12-09 09:45:31,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 09:45:31,752 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2018-12-09 09:45:31,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:45:31,752 INFO L225 Difference]: With dead ends: 107 [2018-12-09 09:45:31,752 INFO L226 Difference]: Without dead ends: 107 [2018-12-09 09:45:31,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-09 09:45:31,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-09 09:45:31,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-09 09:45:31,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 09:45:31,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-12-09 09:45:31,755 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 91 [2018-12-09 09:45:31,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:45:31,755 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-12-09 09:45:31,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 09:45:31,755 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-12-09 09:45:31,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 09:45:31,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:45:31,756 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:45:31,756 INFO L423 AbstractCegarLoop]: === Iteration 30 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:45:31,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:45:31,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1133944862, now seen corresponding path program 1 times [2018-12-09 09:45:31,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:45:31,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:45:31,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:31,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:45:31,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:45:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-09 09:45:31,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:45:31,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 09:45:31,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 09:45:31,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 09:45:31,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:45:31,841 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 12 states. [2018-12-09 09:45:31,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:45:31,948 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-12-09 09:45:31,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 09:45:31,948 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-12-09 09:45:31,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:45:31,948 INFO L225 Difference]: With dead ends: 109 [2018-12-09 09:45:31,948 INFO L226 Difference]: Without dead ends: 107 [2018-12-09 09:45:31,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-09 09:45:31,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-09 09:45:31,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-09 09:45:31,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 09:45:31,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-12-09 09:45:31,950 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 94 [2018-12-09 09:45:31,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:45:31,951 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-12-09 09:45:31,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 09:45:31,951 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-12-09 09:45:31,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 09:45:31,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:45:31,951 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:45:31,951 INFO L423 AbstractCegarLoop]: === Iteration 31 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:45:31,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:45:31,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1162618541, now seen corresponding path program 1 times [2018-12-09 09:45:31,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:45:31,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:45:31,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:31,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:45:31,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:45:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-09 09:45:32,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:45:32,022 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:45:32,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:45:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:45:32,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:45:32,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 09:45:32,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-09 09:45:32,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:45:32,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:32,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:32,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-09 09:45:32,134 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-09 09:45:32,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:45:32,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 11 [2018-12-09 09:45:32,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 09:45:32,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 09:45:32,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:45:32,150 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 12 states. [2018-12-09 09:45:32,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:45:32,318 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-12-09 09:45:32,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 09:45:32,318 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-12-09 09:45:32,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:45:32,318 INFO L225 Difference]: With dead ends: 116 [2018-12-09 09:45:32,318 INFO L226 Difference]: Without dead ends: 116 [2018-12-09 09:45:32,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-12-09 09:45:32,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-09 09:45:32,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2018-12-09 09:45:32,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 09:45:32,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-12-09 09:45:32,321 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 94 [2018-12-09 09:45:32,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:45:32,321 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-12-09 09:45:32,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 09:45:32,321 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-12-09 09:45:32,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 09:45:32,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:45:32,322 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:45:32,322 INFO L423 AbstractCegarLoop]: === Iteration 32 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:45:32,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:45:32,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1162618540, now seen corresponding path program 1 times [2018-12-09 09:45:32,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:45:32,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:45:32,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:32,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:45:32,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:45:32,982 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 09:45:32,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:45:32,982 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:45:32,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:45:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:45:33,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:45:33,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:45:33,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:45:33,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 09:45:33,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:45:33,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:33,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-12-09 09:45:33,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:45:33,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 09:45:33,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:45:33,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:33,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:45:33,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 09:45:33,219 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:45:33,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:33,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:33,226 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-12-09 09:45:33,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-12-09 09:45:33,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 09:45:33,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:45:33,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:33,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-09 09:45:33,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 09:45:33,282 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:45:33,286 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:33,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:33,293 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-12-09 09:45:33,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:45:33,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2018-12-09 09:45:33,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:45:33,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 46 [2018-12-09 09:45:33,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:45:33,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:33,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 48 [2018-12-09 09:45:33,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:45:33,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-09 09:45:33,410 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:45:33,416 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:33,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:33,426 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:69 [2018-12-09 09:45:33,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:45:33,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:45:33,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:45:33,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 96 [2018-12-09 09:45:33,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:45:33,486 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 140 [2018-12-09 09:45:33,487 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 09:45:33,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:33,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:45:33,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 77 [2018-12-09 09:45:33,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:45:33,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-12-09 09:45:33,528 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:45:33,535 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:33,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:33,544 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:109, output treesize:109 [2018-12-09 09:45:34,351 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_$Pointer$.offset)| .cse0 (let ((.cse1 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))))) |c_#memory_$Pointer$.offset|)) is different from true [2018-12-09 09:45:34,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:45:34,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:45:34,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 94 [2018-12-09 09:45:34,368 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 70 [2018-12-09 09:45:34,371 INFO L267 ElimStorePlain]: Start of recursive call 3: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-12-09 09:45:34,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 68 [2018-12-09 09:45:34,460 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 09:45:34,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2018-12-09 09:45:34,462 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:45:34,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 72 [2018-12-09 09:45:34,473 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 09:45:34,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:45:34,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 72 [2018-12-09 09:45:34,487 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-09 09:45:34,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-09 09:45:34,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2018-12-09 09:45:34,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 27 [2018-12-09 09:45:34,704 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-12-09 09:45:34,717 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 09:45:34,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2018-12-09 09:45:34,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 27 [2018-12-09 09:45:34,732 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-12-09 09:45:34,747 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 09:45:34,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2018-12-09 09:45:34,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 27 [2018-12-09 09:45:34,762 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-12-09 09:45:34,776 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 09:45:34,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2018-12-09 09:45:34,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 27 [2018-12-09 09:45:34,791 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-12-09 09:45:34,806 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 09:45:34,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 12 xjuncts. [2018-12-09 09:45:34,884 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 3 variables, input treesize:132, output treesize:377 [2018-12-09 09:45:35,601 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base| (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_dll_circular_update_at_#in~head.base|) .cse0))))) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))) is different from true [2018-12-09 09:45:35,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-12-09 09:45:35,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:45:35,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:45:35,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2018-12-09 09:45:35,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:45:35,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:35,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2018-12-09 09:45:35,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:45:35,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:45:35,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2018-12-09 09:45:35,650 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:45:35,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:35,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 09:45:35,671 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:103, output treesize:59 [2018-12-09 09:45:36,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-12-09 09:45:36,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-12-09 09:45:36,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:45:36,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:36,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-12-09 09:45:36,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2018-12-09 09:45:36,613 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:45:36,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:36,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-12-09 09:45:36,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2018-12-09 09:45:36,630 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 09:45:36,634 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:36,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-12-09 09:45:36,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-09 09:45:36,645 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 09:45:36,649 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:36,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:36,656 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:111, output treesize:11 [2018-12-09 09:45:36,694 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2018-12-09 09:45:36,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:45:36,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 40] total 65 [2018-12-09 09:45:36,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-09 09:45:36,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-09 09:45:36,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=3821, Unknown=2, NotChecked=250, Total=4290 [2018-12-09 09:45:36,710 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 66 states. [2018-12-09 09:45:39,614 WARN L180 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2018-12-09 09:45:40,600 WARN L180 SmtUtils]: Spent 863.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2018-12-09 09:45:43,127 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2018-12-09 09:45:43,359 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2018-12-09 09:45:46,164 WARN L180 SmtUtils]: Spent 2.74 s on a formula simplification. DAG size of input: 100 DAG size of output: 67 [2018-12-09 09:45:50,380 WARN L180 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 108 DAG size of output: 71 [2018-12-09 09:45:52,284 WARN L180 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 102 DAG size of output: 66 [2018-12-09 09:45:53,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:45:53,417 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-12-09 09:45:53,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-09 09:45:53,417 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 94 [2018-12-09 09:45:53,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:45:53,418 INFO L225 Difference]: With dead ends: 116 [2018-12-09 09:45:53,418 INFO L226 Difference]: Without dead ends: 116 [2018-12-09 09:45:53,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 64 SyntacticMatches, 10 SemanticMatches, 93 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2117 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=617, Invalid=7945, Unknown=2, NotChecked=366, Total=8930 [2018-12-09 09:45:53,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-09 09:45:53,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2018-12-09 09:45:53,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-09 09:45:53,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2018-12-09 09:45:53,421 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 94 [2018-12-09 09:45:53,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:45:53,421 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2018-12-09 09:45:53,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-09 09:45:53,421 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2018-12-09 09:45:53,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 09:45:53,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:45:53,422 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:45:53,422 INFO L423 AbstractCegarLoop]: === Iteration 33 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:45:53,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:45:53,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1982742195, now seen corresponding path program 1 times [2018-12-09 09:45:53,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:45:53,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:45:53,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:53,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:45:53,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:45:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:45:53,940 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 09:45:53,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:45:53,940 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:45:53,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:45:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:45:53,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:45:54,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:45:54,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:45:54,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 09:45:54,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:45:54,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:54,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-12-09 09:45:54,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:45:54,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 09:45:54,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:45:54,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:54,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:54,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-09 09:45:54,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-09 09:45:54,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:45:54,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:45:54,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:54,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:45:54,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-12-09 09:45:54,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-09 09:45:54,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-12-09 09:45:54,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:45:54,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:54,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 09:45:54,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2018-12-09 09:45:54,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-12-09 09:45:54,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:45:54,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-12-09 09:45:54,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:45:54,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:54,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:45:54,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-12-09 09:45:55,051 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_$Pointer$.base)| .cse0 (let ((.cse1 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))))))) is different from true [2018-12-09 09:45:55,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:45:55,054 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:45:55,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 73 [2018-12-09 09:45:55,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 45 [2018-12-09 09:45:55,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 09:45:55,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:45:55,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 09:45:55,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:60 [2018-12-09 09:45:55,572 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0)))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))) is different from true [2018-12-09 09:45:55,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-12-09 09:45:55,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:45:55,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:45:55,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2018-12-09 09:45:55,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:45:55,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:55,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:45:55,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:23 [2018-12-09 09:46:07,945 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 2 not checked. [2018-12-09 09:46:07,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:46:07,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 56 [2018-12-09 09:46:07,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-09 09:46:07,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-09 09:46:07,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2691, Unknown=2, NotChecked=210, Total=3080 [2018-12-09 09:46:07,962 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 56 states. [2018-12-09 09:46:30,308 WARN L180 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2018-12-09 09:46:38,259 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 32 DAG size of output: 20 [2018-12-09 09:46:41,035 WARN L180 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-12-09 09:46:41,424 WARN L180 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-12-09 09:46:41,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:46:41,605 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-12-09 09:46:41,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-09 09:46:41,605 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 99 [2018-12-09 09:46:41,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:46:41,606 INFO L225 Difference]: With dead ends: 112 [2018-12-09 09:46:41,606 INFO L226 Difference]: Without dead ends: 108 [2018-12-09 09:46:41,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 70 SyntacticMatches, 12 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1434 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=434, Invalid=5269, Unknown=5, NotChecked=298, Total=6006 [2018-12-09 09:46:41,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-09 09:46:41,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-12-09 09:46:41,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 09:46:41,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-12-09 09:46:41,609 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 99 [2018-12-09 09:46:41,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:46:41,609 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-12-09 09:46:41,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-09 09:46:41,609 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-12-09 09:46:41,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 09:46:41,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:46:41,609 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:46:41,609 INFO L423 AbstractCegarLoop]: === Iteration 34 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:46:41,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:46:41,610 INFO L82 PathProgramCache]: Analyzing trace with hash -561858850, now seen corresponding path program 1 times [2018-12-09 09:46:41,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:46:41,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:46:41,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:41,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:41,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:46:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:42,309 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-12-09 09:46:43,796 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 09:46:43,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:46:43,797 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:46:43,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:46:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:46:43,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:46:43,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:43,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:43,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 09:46:43,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:46:43,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:43,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-12-09 09:46:43,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:46:43,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 09:46:43,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:46:43,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:43,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:43,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-12-09 09:46:43,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-09 09:46:43,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:46:43,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:46:43,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:43,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:43,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-12-09 09:46:44,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:46:44,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 09:46:44,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:46:44,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:44,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:44,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-12-09 09:46:44,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:44,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 41 [2018-12-09 09:46:44,305 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:46:44,334 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:44,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:44,367 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:47 [2018-12-09 09:46:44,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:44,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2018-12-09 09:46:44,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:46:44,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:46:44,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:44,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:44,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:44,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:44,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 76 [2018-12-09 09:46:44,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:44,642 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 114 [2018-12-09 09:46:44,643 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 09:46:44,658 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:44,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:44,666 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:71 [2018-12-09 09:46:45,844 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|)) (.cse1 (+ dll_circular_update_at_~head.offset 8))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)))) (= (store |c_old(#memory_$Pointer$.offset)| .cse0 (store (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) |c_#memory_$Pointer$.offset|) (<= (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|) dll_circular_update_at_~head.offset)))) is different from true [2018-12-09 09:46:45,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:45,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:45,851 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:46:45,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:45,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:45,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 183 [2018-12-09 09:46:45,885 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 62 treesize of output 88 [2018-12-09 09:46:45,887 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 14 xjuncts. [2018-12-09 09:46:45,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 09:46:45,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:45,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:45,989 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:46:45,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:45,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 117 [2018-12-09 09:46:46,001 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:46:46,011 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 83 [2018-12-09 09:46:46,012 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 09:46:46,032 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:46,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:46,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:46,035 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:46:46,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:46,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:46,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 138 [2018-12-09 09:46:46,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:46,051 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 104 [2018-12-09 09:46:46,052 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 09:46:46,073 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:46,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:46,075 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:46:46,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 117 [2018-12-09 09:46:46,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 43 [2018-12-09 09:46:46,088 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-09 09:46:46,107 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:46:46,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 09:46:46,144 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:164, output treesize:203 [2018-12-09 09:46:46,430 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-12-09 09:46:47,504 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_dll_circular_update_at_#in~head.base|) .cse0)))) (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset)))) is different from true [2018-12-09 09:46:47,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:47,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 111 [2018-12-09 09:46:47,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:47,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-09 09:46:47,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:46:47,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:47,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:47,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:47,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 98 [2018-12-09 09:46:47,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:47,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:47,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:47,682 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 115 [2018-12-09 09:46:47,683 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 09:46:47,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:47,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 88 [2018-12-09 09:46:47,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:47,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:47,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:47,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:47,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 53 [2018-12-09 09:46:47,794 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 09:46:47,809 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:47,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:47,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:47,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:47,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 97 [2018-12-09 09:46:47,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:47,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:47,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:47,899 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 93 [2018-12-09 09:46:47,900 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 09:46:47,922 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:47,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:47,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:47,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:47,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 137 [2018-12-09 09:46:47,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:47,982 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:46:47,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:47,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:48,000 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 159 [2018-12-09 09:46:48,001 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 09:46:48,036 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:48,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:48,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:48,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:48,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 127 [2018-12-09 09:46:48,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:48,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:48,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:48,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:48,101 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 122 [2018-12-09 09:46:48,102 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 09:46:48,124 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:48,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 09:46:48,155 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 9 variables, input treesize:326, output treesize:203 [2018-12-09 09:46:49,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:49,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:49,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 86 [2018-12-09 09:46:49,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:49,246 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 55 [2018-12-09 09:46:49,247 INFO L267 ElimStorePlain]: Start of recursive call 3: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-12-09 09:46:49,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:49,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 65 [2018-12-09 09:46:49,305 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-12-09 09:46:49,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:49,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 63 [2018-12-09 09:46:49,322 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-12-09 09:46:49,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 63 [2018-12-09 09:46:49,342 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2018-12-09 09:46:49,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 35 [2018-12-09 09:46:49,351 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-09 09:46:49,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 11 xjuncts. [2018-12-09 09:46:50,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-12-09 09:46:50,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,028 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 41 [2018-12-09 09:46:50,028 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 09:46:50,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 09:46:50,040 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 09:46:50,045 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:50,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 49 [2018-12-09 09:46:50,056 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2018-12-09 09:46:50,057 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-09 09:46:50,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-12-09 09:46:50,072 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 09:46:50,078 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:50,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-12-09 09:46:50,089 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2018-12-09 09:46:50,090 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-09 09:46:50,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-12-09 09:46:50,103 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 09:46:50,108 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:50,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-12-09 09:46:50,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 13 [2018-12-09 09:46:50,113 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 09:46:50,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:46:50,122 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-12-09 09:46:50,131 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:46:50,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-12-09 09:46:50,142 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2018-12-09 09:46:50,143 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-09 09:46:50,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-12-09 09:46:50,153 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 09:46:50,160 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:50,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 49 [2018-12-09 09:46:50,172 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2018-12-09 09:46:50,172 INFO L267 ElimStorePlain]: Start of recursive call 24: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-09 09:46:50,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-12-09 09:46:50,184 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 09:46:50,190 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:50,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-12-09 09:46:50,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 13 [2018-12-09 09:46:50,195 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 09:46:50,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:46:50,205 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-12-09 09:46:50,211 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:46:50,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-12-09 09:46:50,222 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2018-12-09 09:46:50,222 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-09 09:46:50,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-12-09 09:46:50,239 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-09 09:46:50,244 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:50,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-12-09 09:46:50,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:46:50,250 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-12-09 09:46:50,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 13 [2018-12-09 09:46:50,261 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-09 09:46:50,267 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:46:50,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 49 [2018-12-09 09:46:50,279 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2018-12-09 09:46:50,280 INFO L267 ElimStorePlain]: Start of recursive call 36: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-09 09:46:50,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-12-09 09:46:50,295 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-09 09:46:50,300 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:46:50,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-12-09 09:46:50,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:46:50,308 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-12-09 09:46:50,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:46:50,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 13 [2018-12-09 09:46:50,318 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-09 09:46:50,324 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:46:50,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-09 09:46:50,483 INFO L202 ElimStorePlain]: Needed 40 recursive calls to eliminate 6 variables, input treesize:299, output treesize:58 [2018-12-09 09:46:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 2 not checked. [2018-12-09 09:46:50,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:46:50,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 38] total 61 [2018-12-09 09:46:50,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-09 09:46:50,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-09 09:46:50,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3257, Unknown=2, NotChecked=230, Total=3660 [2018-12-09 09:46:50,802 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 61 states. [2018-12-09 09:46:52,213 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 66 [2018-12-09 09:46:56,042 WARN L180 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 62 DAG size of output: 32 [2018-12-09 09:46:57,956 WARN L180 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 59 DAG size of output: 28 [2018-12-09 09:46:58,569 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-09 09:46:58,846 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-09 09:46:59,120 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-12-09 09:46:59,426 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 105 [2018-12-09 09:46:59,741 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 105 [2018-12-09 09:47:00,070 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2018-12-09 09:47:00,404 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2018-12-09 09:47:00,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:47:00,486 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2018-12-09 09:47:00,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-09 09:47:00,486 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 99 [2018-12-09 09:47:00,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:47:00,486 INFO L225 Difference]: With dead ends: 101 [2018-12-09 09:47:00,487 INFO L226 Difference]: Without dead ends: 101 [2018-12-09 09:47:00,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 66 SyntacticMatches, 13 SemanticMatches, 85 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1425 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=484, Invalid=6662, Unknown=2, NotChecked=334, Total=7482 [2018-12-09 09:47:00,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-09 09:47:00,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-09 09:47:00,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-09 09:47:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2018-12-09 09:47:00,489 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 99 [2018-12-09 09:47:00,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:47:00,489 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2018-12-09 09:47:00,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-09 09:47:00,489 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2018-12-09 09:47:00,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 09:47:00,489 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:47:00,490 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:47:00,490 INFO L423 AbstractCegarLoop]: === Iteration 35 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:47:00,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:47:00,490 INFO L82 PathProgramCache]: Analyzing trace with hash -237756565, now seen corresponding path program 1 times [2018-12-09 09:47:00,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:47:00,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:47:00,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:47:00,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:47:00,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:47:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:47:00,976 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 09:47:00,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:47:00,977 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:47:00,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:47:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:47:01,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:47:01,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:47:01,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-12-09 09:47:01,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:47:01,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:47:01,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 09:47:01,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 09:47:01,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 09:47:01,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:38 [2018-12-09 09:47:01,200 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-09 09:47:01,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:47:01,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 7] total 36 [2018-12-09 09:47:01,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-09 09:47:01,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-09 09:47:01,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1231, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 09:47:01,215 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 37 states. [2018-12-09 09:47:04,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:47:04,207 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-12-09 09:47:04,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 09:47:04,208 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 100 [2018-12-09 09:47:04,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:47:04,210 INFO L225 Difference]: With dead ends: 100 [2018-12-09 09:47:04,210 INFO L226 Difference]: Without dead ends: 100 [2018-12-09 09:47:04,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 95 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=283, Invalid=2687, Unknown=0, NotChecked=0, Total=2970 [2018-12-09 09:47:04,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-09 09:47:04,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-09 09:47:04,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-09 09:47:04,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2018-12-09 09:47:04,219 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 100 [2018-12-09 09:47:04,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:47:04,220 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2018-12-09 09:47:04,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-09 09:47:04,220 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2018-12-09 09:47:04,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 09:47:04,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:47:04,223 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:47:04,223 INFO L423 AbstractCegarLoop]: === Iteration 36 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2018-12-09 09:47:04,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:47:04,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1560894814, now seen corresponding path program 1 times [2018-12-09 09:47:04,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:47:04,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:47:04,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:47:04,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:47:04,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:47:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:47:05,714 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 09:47:05,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:47:05,714 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:47:05,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:47:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:47:05,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:47:05,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:47:05,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:47:05,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-09 09:47:05,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:47:05,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:47:05,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:34 [2018-12-09 09:47:05,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 09:47:05,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 09:47:05,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:47:05,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:47:05,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:47:05,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-12-09 09:47:06,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-09 09:47:06,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 09:47:06,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:47:06,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:47:06,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:47:06,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:47 [2018-12-09 09:47:06,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-09 09:47:06,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-12-09 09:47:06,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:47:06,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:47:06,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 09:47:06,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2018-12-09 09:47:06,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 47 [2018-12-09 09:47:06,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:47:06,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 59 [2018-12-09 09:47:06,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:47:06,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:47:06,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:47:06,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:69 [2018-12-09 09:47:06,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 09:47:06,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:47:06,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-12-09 09:47:06,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 09:47:06,614 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:47:06,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:47:06,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-09 09:47:06,620 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:47:06,625 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:47:06,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 09:47:06,633 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:72, output treesize:18 [2018-12-09 09:47:12,997 WARN L180 SmtUtils]: Spent 604.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 09:47:13,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76 [2018-12-09 09:47:13,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2018-12-09 09:47:13,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 09:47:13,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:47:13,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-09 09:47:13,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:114, output treesize:156 [2018-12-09 09:47:13,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 09:47:13,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:47:13,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-12-09 09:47:13,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:47:13,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-09 09:47:13,162 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:47:13,165 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:47:13,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 09:47:13,170 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:59, output treesize:18 [2018-12-09 09:47:20,418 WARN L180 SmtUtils]: Spent 470.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 09:47:20,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 46 [2018-12-09 09:47:20,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:47:20,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:47:20,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:47:20,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 60 [2018-12-09 09:47:20,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:47:20,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:47:20,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 09:47:20,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:92, output treesize:70 [2018-12-09 09:47:20,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 09:47:20,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:47:20,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 09:47:20,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:42 [2018-12-09 09:47:20,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 09:47:20,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:47:20,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 09:47:20,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:42 [2018-12-09 09:47:20,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 09:47:20,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:47:20,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 09:47:20,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:47:20,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 09:47:20,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:31 [2018-12-09 09:47:23,111 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2018-12-09 09:47:36,915 WARN L180 SmtUtils]: Spent 2.36 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-09 09:47:38,920 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((main_~s~0.offset Int) (v_main_~s~0.base_BEFORE_CALL_30 Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_30))) (let ((.cse0 (select .cse1 main_~s~0.offset))) (and (<= 0 main_~s~0.offset) (= .cse0 (select .cse1 (+ main_~s~0.offset 4))) (<= main_~s~0.offset 0) (not (= .cse0 v_main_~s~0.base_BEFORE_CALL_30)))))) (exists ((dll_circular_destroy_~head.offset Int)) (and (= (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_dll_circular_destroy_#in~head.base|) dll_circular_destroy_~head.offset) 0) |c_dll_circular_destroy_#in~head.base| 0) |c_#valid|) (<= dll_circular_destroy_~head.offset 0) (<= 0 dll_circular_destroy_~head.offset)))) is different from true [2018-12-09 09:47:38,928 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:47:38,928 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:47:38,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:47:38,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 46 [2018-12-09 09:47:38,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-12-09 09:47:38,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:47:38,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:47:38,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 53 [2018-12-09 09:47:38,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:47:38,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:47:38,961 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:47:38,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 52 [2018-12-09 09:47:38,962 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:47:38,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:47:38,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-12-09 09:47:38,980 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 09:47:38,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:47:38,993 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:47:38,993 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:47:38,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-12-09 09:47:38,994 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:47:39,006 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 09:47:39,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-09 09:47:39,023 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:102, output treesize:51 [2018-12-09 09:47:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 12 refuted. 2 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 09:47:39,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 09:47:39,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 36] total 65 [2018-12-09 09:47:39,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-09 09:47:39,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-09 09:47:39,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=3912, Unknown=31, NotChecked=126, Total=4290 [2018-12-09 09:47:39,166 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand 66 states. [2018-12-09 09:48:04,163 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2018-12-09 09:48:10,128 WARN L180 SmtUtils]: Spent 4.94 s on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2018-12-09 09:48:16,227 WARN L180 SmtUtils]: Spent 5.05 s on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2018-12-09 09:48:20,851 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2018-12-09 09:48:20,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:48:20,852 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2018-12-09 09:48:20,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-09 09:48:20,853 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 104 [2018-12-09 09:48:20,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:48:20,853 INFO L225 Difference]: With dead ends: 99 [2018-12-09 09:48:20,853 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 09:48:20,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 78 SyntacticMatches, 8 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1925 ImplicationChecksByTransitivity, 57.0s TimeCoverageRelationStatistics Valid=494, Invalid=7482, Unknown=38, NotChecked=176, Total=8190 [2018-12-09 09:48:20,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 09:48:20,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 09:48:20,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 09:48:20,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 09:48:20,854 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2018-12-09 09:48:20,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:48:20,854 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 09:48:20,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-09 09:48:20,854 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 09:48:20,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 09:48:20,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 09:48:20 BoogieIcfgContainer [2018-12-09 09:48:20,859 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 09:48:20,859 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 09:48:20,859 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 09:48:20,859 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 09:48:20,860 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:44:00" (3/4) ... [2018-12-09 09:48:20,863 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 09:48:20,868 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 09:48:20,868 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-12-09 09:48:20,868 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_destroy [2018-12-09 09:48:20,868 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-09 09:48:20,869 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-09 09:48:20,869 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 09:48:20,869 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_create [2018-12-09 09:48:20,869 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_update_at [2018-12-09 09:48:20,869 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-12-09 09:48:20,869 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_get_data_at [2018-12-09 09:48:20,873 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2018-12-09 09:48:20,874 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-09 09:48:20,874 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 09:48:20,901 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d6e19dd4-eeae-454f-bf25-e364a900e7eb/bin-2019/uautomizer/witness.graphml [2018-12-09 09:48:20,901 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 09:48:20,902 INFO L168 Benchmark]: Toolchain (without parser) took 261137.70 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 244.8 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 61.4 MB. Max. memory is 11.5 GB. [2018-12-09 09:48:20,902 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:48:20,903 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 956.0 MB in the beginning and 1.2 GB in the end (delta: -204.0 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-12-09 09:48:20,903 INFO L168 Benchmark]: Boogie Preprocessor took 42.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2018-12-09 09:48:20,903 INFO L168 Benchmark]: RCFGBuilder took 311.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. [2018-12-09 09:48:20,903 INFO L168 Benchmark]: TraceAbstraction took 260437.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -51.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-12-09 09:48:20,903 INFO L168 Benchmark]: Witness Printer took 42.58 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. [2018-12-09 09:48:20,905 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 300.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 956.0 MB in the beginning and 1.2 GB in the end (delta: -204.0 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 311.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 260437.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -51.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Witness Printer took 42.58 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 615]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 610]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 610]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 571]: 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 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 117 locations, 31 error locations. SAFE Result, 260.4s OverallTime, 36 OverallIterations, 3 TraceHistogramMax, 164.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2710 SDtfs, 2753 SDslu, 15576 SDs, 0 SdLazy, 25953 SolverSat, 775 SolverUnsat, 59 SolverUnknown, 0 SolverNotchecked, 70.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1836 GetRequests, 845 SyntacticMatches, 95 SemanticMatches, 896 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 10554 ImplicationChecksByTransitivity, 179.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 36 MinimizatonAttempts, 193 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 94.4s InterpolantComputationTime, 3103 NumberOfCodeBlocks, 3103 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 3051 ConstructedInterpolants, 239 QuantifiedInterpolants, 3514077 SizeOfPredicates, 239 NumberOfNonLiveVariables, 5211 ConjunctsInSsa, 910 ConjunctsInUnsatCore, 52 InterpolantComputations, 20 PerfectInterpolantSequences, 658/986 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...