./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/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 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/list-simple/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.24-0ed9222-m [2019-01-14 20:07:16,463 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 20:07:16,466 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 20:07:16,482 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 20:07:16,483 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 20:07:16,486 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 20:07:16,489 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 20:07:16,492 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 20:07:16,494 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 20:07:16,499 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 20:07:16,502 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 20:07:16,502 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 20:07:16,504 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 20:07:16,504 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 20:07:16,514 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 20:07:16,515 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 20:07:16,516 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 20:07:16,520 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 20:07:16,523 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 20:07:16,527 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 20:07:16,528 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 20:07:16,529 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 20:07:16,534 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 20:07:16,536 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 20:07:16,536 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 20:07:16,538 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 20:07:16,539 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 20:07:16,541 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 20:07:16,543 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 20:07:16,547 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 20:07:16,547 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 20:07:16,548 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 20:07:16,548 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 20:07:16,548 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 20:07:16,551 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 20:07:16,552 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 20:07:16,554 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 20:07:16,579 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 20:07:16,582 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 20:07:16,586 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 20:07:16,587 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 20:07:16,587 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 20:07:16,588 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 20:07:16,588 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 20:07:16,588 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 20:07:16,588 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 20:07:16,588 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 20:07:16,589 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 20:07:16,590 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 20:07:16,590 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 20:07:16,590 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 20:07:16,591 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 20:07:16,591 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 20:07:16,591 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 20:07:16,591 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 20:07:16,591 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 20:07:16,591 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 20:07:16,592 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 20:07:16,594 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 20:07:16,594 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 20:07:16,595 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 20:07:16,595 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 20:07:16,595 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16891def4f6ae6ab6c00fe328146dbdee1a68356 [2019-01-14 20:07:16,661 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 20:07:16,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 20:07:16,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 20:07:16,686 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 20:07:16,686 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 20:07:16,688 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-simple/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-14 20:07:16,745 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a1996736/6f02c6351d94480bb42de13b22b06aca/FLAG34ba37f30 [2019-01-14 20:07:17,215 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 20:07:17,216 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-simple/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-14 20:07:17,229 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a1996736/6f02c6351d94480bb42de13b22b06aca/FLAG34ba37f30 [2019-01-14 20:07:17,551 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a1996736/6f02c6351d94480bb42de13b22b06aca [2019-01-14 20:07:17,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 20:07:17,557 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 20:07:17,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 20:07:17,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 20:07:17,563 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 20:07:17,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 08:07:17" (1/1) ... [2019-01-14 20:07:17,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4023dc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:07:17, skipping insertion in model container [2019-01-14 20:07:17,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 08:07:17" (1/1) ... [2019-01-14 20:07:17,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 20:07:17,630 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 20:07:17,989 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 20:07:18,000 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 20:07:18,163 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 20:07:18,225 INFO L195 MainTranslator]: Completed translation [2019-01-14 20:07:18,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:07:18 WrapperNode [2019-01-14 20:07:18,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 20:07:18,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 20:07:18,227 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 20:07:18,227 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 20:07:18,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:07:18" (1/1) ... [2019-01-14 20:07:18,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:07:18" (1/1) ... [2019-01-14 20:07:18,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:07:18" (1/1) ... [2019-01-14 20:07:18,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:07:18" (1/1) ... [2019-01-14 20:07:18,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:07:18" (1/1) ... [2019-01-14 20:07:18,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:07:18" (1/1) ... [2019-01-14 20:07:18,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:07:18" (1/1) ... [2019-01-14 20:07:18,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 20:07:18,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 20:07:18,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 20:07:18,326 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 20:07:18,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:07:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 20:07:18,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 20:07:18,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 20:07:18,388 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-14 20:07:18,388 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-14 20:07:18,388 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-14 20:07:18,388 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-01-14 20:07:18,388 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-01-14 20:07:18,388 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2019-01-14 20:07:18,389 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2019-01-14 20:07:18,390 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2019-01-14 20:07:18,390 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 20:07:18,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 20:07:18,390 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-14 20:07:18,390 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-14 20:07:18,391 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 20:07:18,391 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 20:07:18,391 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 20:07:18,392 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 20:07:18,392 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 20:07:18,392 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 20:07:18,392 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 20:07:18,392 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 20:07:18,392 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 20:07:18,392 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 20:07:18,393 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 20:07:18,394 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 20:07:18,394 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 20:07:18,394 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 20:07:18,394 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 20:07:18,394 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 20:07:18,394 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 20:07:18,394 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 20:07:18,395 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 20:07:18,395 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 20:07:18,395 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 20:07:18,395 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 20:07:18,395 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 20:07:18,395 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 20:07:18,395 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 20:07:18,395 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 20:07:18,396 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 20:07:18,397 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 20:07:18,397 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 20:07:18,397 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 20:07:18,398 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 20:07:18,398 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 20:07:18,398 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 20:07:18,398 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 20:07:18,398 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 20:07:18,398 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 20:07:18,398 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 20:07:18,398 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 20:07:18,399 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 20:07:18,400 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 20:07:18,400 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 20:07:18,400 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 20:07:18,400 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 20:07:18,400 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 20:07:18,401 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 20:07:18,401 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 20:07:18,402 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 20:07:18,402 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 20:07:18,402 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 20:07:18,402 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 20:07:18,402 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 20:07:18,402 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 20:07:18,402 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 20:07:18,403 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 20:07:18,403 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 20:07:18,403 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 20:07:18,403 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 20:07:18,403 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 20:07:18,403 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-14 20:07:18,403 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 20:07:18,403 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 20:07:18,403 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-14 20:07:18,404 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 20:07:18,406 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 20:07:18,406 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-14 20:07:18,406 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 20:07:18,406 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 20:07:18,406 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 20:07:18,406 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 20:07:18,407 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 20:07:18,407 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 20:07:18,408 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 20:07:18,408 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 20:07:18,408 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 20:07:18,408 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 20:07:18,408 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 20:07:18,408 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 20:07:18,408 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 20:07:18,408 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 20:07:18,409 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 20:07:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 20:07:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 20:07:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 20:07:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 20:07:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 20:07:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 20:07:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 20:07:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 20:07:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 20:07:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 20:07:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 20:07:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 20:07:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 20:07:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 20:07:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 20:07:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 20:07:18,412 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 20:07:18,413 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 20:07:18,413 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 20:07:18,414 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 20:07:18,414 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 20:07:18,414 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 20:07:18,414 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 20:07:18,414 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-14 20:07:18,414 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-01-14 20:07:18,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 20:07:18,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 20:07:18,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 20:07:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-01-14 20:07:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2019-01-14 20:07:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 20:07:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 20:07:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2019-01-14 20:07:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 20:07:18,417 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2019-01-14 20:07:18,417 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 20:07:18,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 20:07:18,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 20:07:19,080 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-01-14 20:07:19,377 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 20:07:19,378 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 20:07:19,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:07:19 BoogieIcfgContainer [2019-01-14 20:07:19,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 20:07:19,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 20:07:19,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 20:07:19,384 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 20:07:19,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 08:07:17" (1/3) ... [2019-01-14 20:07:19,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c82ff48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 08:07:19, skipping insertion in model container [2019-01-14 20:07:19,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:07:18" (2/3) ... [2019-01-14 20:07:19,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c82ff48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 08:07:19, skipping insertion in model container [2019-01-14 20:07:19,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:07:19" (3/3) ... [2019-01-14 20:07:19,389 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-14 20:07:19,399 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 20:07:19,407 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2019-01-14 20:07:19,424 INFO L257 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2019-01-14 20:07:19,451 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 20:07:19,452 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 20:07:19,452 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 20:07:19,453 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 20:07:19,453 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 20:07:19,453 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 20:07:19,453 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 20:07:19,453 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 20:07:19,454 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 20:07:19,475 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-01-14 20:07:19,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 20:07:19,485 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:07:19,486 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:07:19,489 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:07:19,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:07:19,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1471092252, now seen corresponding path program 1 times [2019-01-14 20:07:19,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:07:19,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:07:19,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:19,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:19,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:07:19,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:07:19,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 20:07:19,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 20:07:19,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 20:07:19,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:07:19,697 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 3 states. [2019-01-14 20:07:19,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:07:19,968 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2019-01-14 20:07:19,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 20:07:19,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-14 20:07:19,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:07:19,981 INFO L225 Difference]: With dead ends: 110 [2019-01-14 20:07:19,981 INFO L226 Difference]: Without dead ends: 103 [2019-01-14 20:07:19,983 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 [2019-01-14 20:07:20,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-14 20:07:20,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-14 20:07:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-14 20:07:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-01-14 20:07:20,036 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 12 [2019-01-14 20:07:20,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:07:20,036 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-01-14 20:07:20,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 20:07:20,037 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-01-14 20:07:20,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 20:07:20,037 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:07:20,038 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:07:20,038 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:07:20,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:07:20,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1471092251, now seen corresponding path program 1 times [2019-01-14 20:07:20,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:07:20,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:07:20,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:20,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:20,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:20,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:07:20,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:07:20,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 20:07:20,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 20:07:20,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 20:07:20,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:07:20,185 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 3 states. [2019-01-14 20:07:20,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:07:20,577 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2019-01-14 20:07:20,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 20:07:20,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-14 20:07:20,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:07:20,580 INFO L225 Difference]: With dead ends: 100 [2019-01-14 20:07:20,582 INFO L226 Difference]: Without dead ends: 100 [2019-01-14 20:07:20,583 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 [2019-01-14 20:07:20,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-14 20:07:20,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-14 20:07:20,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-14 20:07:20,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-01-14 20:07:20,596 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 12 [2019-01-14 20:07:20,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:07:20,597 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-01-14 20:07:20,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 20:07:20,598 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-01-14 20:07:20,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 20:07:20,598 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:07:20,599 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] [2019-01-14 20:07:20,600 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:07:20,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:07:20,600 INFO L82 PathProgramCache]: Analyzing trace with hash 322104282, now seen corresponding path program 1 times [2019-01-14 20:07:20,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:07:20,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:07:20,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:20,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:20,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:20,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:07:20,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:07:20,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:07:20,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 20:07:20,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 20:07:20,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 20:07:20,729 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 5 states. [2019-01-14 20:07:20,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:07:20,820 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2019-01-14 20:07:20,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 20:07:20,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-01-14 20:07:20,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:07:20,823 INFO L225 Difference]: With dead ends: 101 [2019-01-14 20:07:20,824 INFO L226 Difference]: Without dead ends: 101 [2019-01-14 20:07:20,824 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 [2019-01-14 20:07:20,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-14 20:07:20,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-14 20:07:20,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 20:07:20,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-01-14 20:07:20,837 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 20 [2019-01-14 20:07:20,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:07:20,839 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-01-14 20:07:20,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 20:07:20,840 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-01-14 20:07:20,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 20:07:20,841 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:07:20,841 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] [2019-01-14 20:07:20,842 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:07:20,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:07:20,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1342193716, now seen corresponding path program 1 times [2019-01-14 20:07:20,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:07:20,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:07:20,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:20,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:20,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 20:07:21,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:07:21,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:07:21,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:07:21,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:07:21,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:07:21,051 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 6 states. [2019-01-14 20:07:21,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:07:21,387 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-01-14 20:07:21,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:07:21,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-01-14 20:07:21,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:07:21,392 INFO L225 Difference]: With dead ends: 101 [2019-01-14 20:07:21,392 INFO L226 Difference]: Without dead ends: 101 [2019-01-14 20:07:21,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:07:21,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-14 20:07:21,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-01-14 20:07:21,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-14 20:07:21,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-01-14 20:07:21,404 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 30 [2019-01-14 20:07:21,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:07:21,404 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-01-14 20:07:21,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:07:21,405 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-01-14 20:07:21,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 20:07:21,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:07:21,407 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] [2019-01-14 20:07:21,407 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:07:21,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:07:21,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1342193717, now seen corresponding path program 1 times [2019-01-14 20:07:21,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:07:21,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:07:21,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:21,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:21,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 20:07:21,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:07:21,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:07:21,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:07:21,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:07:21,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:07:21,520 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 6 states. [2019-01-14 20:07:21,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:07:21,786 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2019-01-14 20:07:21,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:07:21,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-01-14 20:07:21,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:07:21,789 INFO L225 Difference]: With dead ends: 100 [2019-01-14 20:07:21,789 INFO L226 Difference]: Without dead ends: 100 [2019-01-14 20:07:21,789 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 [2019-01-14 20:07:21,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-14 20:07:21,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-01-14 20:07:21,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-14 20:07:21,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2019-01-14 20:07:21,802 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 30 [2019-01-14 20:07:21,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:07:21,802 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2019-01-14 20:07:21,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:07:21,803 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2019-01-14 20:07:21,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 20:07:21,804 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:07:21,804 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] [2019-01-14 20:07:21,804 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:07:21,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:07:21,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1357973588, now seen corresponding path program 1 times [2019-01-14 20:07:21,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:07:21,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:07:21,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:21,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:21,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:07:22,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:07:22,099 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 20:07:22,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:22,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:07:23,662 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 [2019-01-14 20:07:23,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:23,674 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. [2019-01-14 20:07:23,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-01-14 20:07:23,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:07:23,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:07:23,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-01-14 20:07:23,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 20:07:23,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 20:07:23,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=96, Unknown=4, NotChecked=0, Total=132 [2019-01-14 20:07:23,718 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 12 states. [2019-01-14 20:07:24,268 WARN L181 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 20:07:24,728 WARN L181 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 20:07:26,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:07:26,279 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2019-01-14 20:07:26,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 20:07:26,285 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-01-14 20:07:26,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:07:26,287 INFO L225 Difference]: With dead ends: 140 [2019-01-14 20:07:26,287 INFO L226 Difference]: Without dead ends: 140 [2019-01-14 20:07:26,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=58, Invalid=178, Unknown=4, NotChecked=0, Total=240 [2019-01-14 20:07:26,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-14 20:07:26,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 104. [2019-01-14 20:07:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-14 20:07:26,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2019-01-14 20:07:26,297 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 32 [2019-01-14 20:07:26,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:07:26,298 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2019-01-14 20:07:26,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 20:07:26,298 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2019-01-14 20:07:26,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 20:07:26,300 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:07:26,301 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] [2019-01-14 20:07:26,301 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:07:26,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:07:26,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1357973587, now seen corresponding path program 1 times [2019-01-14 20:07:26,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:07:26,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:07:26,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:26,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:26,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:26,583 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-14 20:07:26,993 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:07:26,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:07:26,993 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 20:07:27,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:27,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:07:27,075 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 [2019-01-14 20:07:27,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:27,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:27,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 20:07:27,471 WARN L860 $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 [2019-01-14 20:07:27,482 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 [2019-01-14 20:07:27,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:27,489 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. [2019-01-14 20:07:27,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-14 20:07:27,523 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2019-01-14 20:07:27,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:07:27,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2019-01-14 20:07:27,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 20:07:27,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 20:07:27,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=56, Unknown=1, NotChecked=14, Total=90 [2019-01-14 20:07:27,551 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand 10 states. [2019-01-14 20:07:28,355 WARN L181 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-14 20:07:29,077 WARN L181 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2019-01-14 20:07:29,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:07:29,591 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2019-01-14 20:07:29,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 20:07:29,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-01-14 20:07:29,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:07:29,595 INFO L225 Difference]: With dead ends: 105 [2019-01-14 20:07:29,595 INFO L226 Difference]: Without dead ends: 105 [2019-01-14 20:07:29,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=39, Invalid=120, Unknown=1, NotChecked=22, Total=182 [2019-01-14 20:07:29,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-14 20:07:29,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-01-14 20:07:29,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-14 20:07:29,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2019-01-14 20:07:29,602 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 32 [2019-01-14 20:07:29,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:07:29,603 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2019-01-14 20:07:29,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 20:07:29,603 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2019-01-14 20:07:29,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-14 20:07:29,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:07:29,606 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] [2019-01-14 20:07:29,606 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:07:29,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:07:29,606 INFO L82 PathProgramCache]: Analyzing trace with hash 657593987, now seen corresponding path program 1 times [2019-01-14 20:07:29,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:07:29,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:07:29,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:29,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:29,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:29,875 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 20:07:29,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:07:29,875 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 20:07:29,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:29,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:07:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 20:07:30,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:07:30,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 20:07:30,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:07:30,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:07:30,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:07:30,007 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 6 states. [2019-01-14 20:07:30,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:07:30,091 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2019-01-14 20:07:30,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:07:30,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-01-14 20:07:30,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:07:30,092 INFO L225 Difference]: With dead ends: 105 [2019-01-14 20:07:30,093 INFO L226 Difference]: Without dead ends: 105 [2019-01-14 20:07:30,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:07:30,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-14 20:07:30,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-01-14 20:07:30,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-14 20:07:30,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2019-01-14 20:07:30,097 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 34 [2019-01-14 20:07:30,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:07:30,098 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2019-01-14 20:07:30,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:07:30,098 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2019-01-14 20:07:30,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 20:07:30,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:07:30,101 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] [2019-01-14 20:07:30,101 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:07:30,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:07:30,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1094203578, now seen corresponding path program 1 times [2019-01-14 20:07:30,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:07:30,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:07:30,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:30,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:30,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:30,673 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-14 20:07:30,718 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 20:07:30,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:07:30,718 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 20:07:30,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:30,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:07:30,884 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 20:07:30,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:07:30,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 20:07:30,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 20:07:30,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 20:07:30,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-14 20:07:30,904 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 9 states. [2019-01-14 20:07:31,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:07:31,280 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2019-01-14 20:07:31,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 20:07:31,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-01-14 20:07:31,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:07:31,283 INFO L225 Difference]: With dead ends: 115 [2019-01-14 20:07:31,283 INFO L226 Difference]: Without dead ends: 115 [2019-01-14 20:07:31,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-14 20:07:31,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-14 20:07:31,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2019-01-14 20:07:31,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-14 20:07:31,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2019-01-14 20:07:31,289 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 35 [2019-01-14 20:07:31,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:07:31,289 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2019-01-14 20:07:31,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 20:07:31,289 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2019-01-14 20:07:31,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 20:07:31,290 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:07:31,290 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] [2019-01-14 20:07:31,291 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:07:31,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:07:31,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1094203579, now seen corresponding path program 1 times [2019-01-14 20:07:31,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:07:31,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:07:31,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:31,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:31,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:31,398 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 20:07:31,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:07:31,398 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 20:07:31,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:31,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:07:31,460 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 20:07:31,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:07:31,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2019-01-14 20:07:31,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 20:07:31,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 20:07:31,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 20:07:31,481 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand 5 states. [2019-01-14 20:07:32,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:07:32,115 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2019-01-14 20:07:32,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:07:32,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-01-14 20:07:32,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:07:32,118 INFO L225 Difference]: With dead ends: 108 [2019-01-14 20:07:32,118 INFO L226 Difference]: Without dead ends: 108 [2019-01-14 20:07:32,119 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 [2019-01-14 20:07:32,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-14 20:07:32,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-01-14 20:07:32,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-14 20:07:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2019-01-14 20:07:32,124 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 35 [2019-01-14 20:07:32,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:07:32,126 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2019-01-14 20:07:32,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 20:07:32,126 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2019-01-14 20:07:32,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 20:07:32,127 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:07:32,127 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] [2019-01-14 20:07:32,128 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:07:32,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:07:32,128 INFO L82 PathProgramCache]: Analyzing trace with hash 439427422, now seen corresponding path program 1 times [2019-01-14 20:07:32,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:07:32,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:07:32,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:32,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:32,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:32,453 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 20:07:32,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:07:32,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 20:07:32,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 20:07:32,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 20:07:32,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:07:32,455 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand 7 states. [2019-01-14 20:07:32,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:07:32,644 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2019-01-14 20:07:32,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 20:07:32,645 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-01-14 20:07:32,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:07:32,647 INFO L225 Difference]: With dead ends: 107 [2019-01-14 20:07:32,647 INFO L226 Difference]: Without dead ends: 107 [2019-01-14 20:07:32,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-14 20:07:32,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-14 20:07:32,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-01-14 20:07:32,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-14 20:07:32,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2019-01-14 20:07:32,652 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 36 [2019-01-14 20:07:32,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:07:32,652 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2019-01-14 20:07:32,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 20:07:32,653 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2019-01-14 20:07:32,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 20:07:32,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:07:32,655 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] [2019-01-14 20:07:32,656 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:07:32,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:07:32,656 INFO L82 PathProgramCache]: Analyzing trace with hash 439427423, now seen corresponding path program 1 times [2019-01-14 20:07:32,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:07:32,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:07:32,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:32,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:32,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 20:07:32,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:07:32,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 20:07:32,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 20:07:32,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 20:07:32,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:07:32,776 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 7 states. [2019-01-14 20:07:33,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:07:33,113 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2019-01-14 20:07:33,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 20:07:33,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-01-14 20:07:33,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:07:33,115 INFO L225 Difference]: With dead ends: 105 [2019-01-14 20:07:33,115 INFO L226 Difference]: Without dead ends: 105 [2019-01-14 20:07:33,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-14 20:07:33,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-14 20:07:33,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-14 20:07:33,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-14 20:07:33,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2019-01-14 20:07:33,121 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 36 [2019-01-14 20:07:33,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:07:33,122 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2019-01-14 20:07:33,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 20:07:33,123 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2019-01-14 20:07:33,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-14 20:07:33,125 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:07:33,125 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] [2019-01-14 20:07:33,126 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:07:33,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:07:33,126 INFO L82 PathProgramCache]: Analyzing trace with hash -869726790, now seen corresponding path program 1 times [2019-01-14 20:07:33,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:07:33,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:07:33,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:33,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:33,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:33,418 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 20:07:33,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:07:33,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 20:07:33,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 20:07:33,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 20:07:33,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:07:33,419 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 12 states. [2019-01-14 20:07:33,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:07:33,915 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2019-01-14 20:07:33,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 20:07:33,916 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-01-14 20:07:33,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:07:33,918 INFO L225 Difference]: With dead ends: 111 [2019-01-14 20:07:33,918 INFO L226 Difference]: Without dead ends: 111 [2019-01-14 20:07:33,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-14 20:07:33,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-14 20:07:33,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2019-01-14 20:07:33,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-14 20:07:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2019-01-14 20:07:33,924 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 45 [2019-01-14 20:07:33,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:07:33,924 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2019-01-14 20:07:33,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 20:07:33,924 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2019-01-14 20:07:33,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-14 20:07:33,925 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:07:33,925 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] [2019-01-14 20:07:33,927 INFO L423 AbstractCegarLoop]: === Iteration 14 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:07:33,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:07:33,927 INFO L82 PathProgramCache]: Analyzing trace with hash -869726789, now seen corresponding path program 1 times [2019-01-14 20:07:33,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:07:33,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:07:33,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:33,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:33,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:34,273 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 20:07:34,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:07:34,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 20:07:34,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:07:34,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:07:34,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:07:34,275 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 6 states. [2019-01-14 20:07:34,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:07:34,348 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2019-01-14 20:07:34,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 20:07:34,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-01-14 20:07:34,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:07:34,350 INFO L225 Difference]: With dead ends: 129 [2019-01-14 20:07:34,350 INFO L226 Difference]: Without dead ends: 129 [2019-01-14 20:07:34,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 20:07:34,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-14 20:07:34,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 120. [2019-01-14 20:07:34,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-14 20:07:34,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 139 transitions. [2019-01-14 20:07:34,356 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 139 transitions. Word has length 45 [2019-01-14 20:07:34,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:07:34,356 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 139 transitions. [2019-01-14 20:07:34,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:07:34,356 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2019-01-14 20:07:34,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-14 20:07:34,357 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:07:34,357 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] [2019-01-14 20:07:34,358 INFO L423 AbstractCegarLoop]: === Iteration 15 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:07:34,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:07:34,358 INFO L82 PathProgramCache]: Analyzing trace with hash -869726734, now seen corresponding path program 1 times [2019-01-14 20:07:34,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:07:34,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:07:34,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:34,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:34,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 20:07:34,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:07:34,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 20:07:34,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 20:07:34,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 20:07:34,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:07:34,559 INFO L87 Difference]: Start difference. First operand 120 states and 139 transitions. Second operand 12 states. [2019-01-14 20:07:35,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:07:35,071 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2019-01-14 20:07:35,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 20:07:35,072 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-01-14 20:07:35,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:07:35,074 INFO L225 Difference]: With dead ends: 124 [2019-01-14 20:07:35,074 INFO L226 Difference]: Without dead ends: 124 [2019-01-14 20:07:35,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-14 20:07:35,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-14 20:07:35,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2019-01-14 20:07:35,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-14 20:07:35,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2019-01-14 20:07:35,080 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 45 [2019-01-14 20:07:35,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:07:35,080 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2019-01-14 20:07:35,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 20:07:35,080 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2019-01-14 20:07:35,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-14 20:07:35,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:07:35,081 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] [2019-01-14 20:07:35,082 INFO L423 AbstractCegarLoop]: === Iteration 16 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:07:35,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:07:35,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1383731480, now seen corresponding path program 1 times [2019-01-14 20:07:35,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:07:35,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:07:35,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:35,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:35,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:35,222 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-01-14 20:07:35,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:07:35,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 20:07:35,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:07:35,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:07:35,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:07:35,223 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand 6 states. [2019-01-14 20:07:35,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:07:35,280 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2019-01-14 20:07:35,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:07:35,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-01-14 20:07:35,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:07:35,282 INFO L225 Difference]: With dead ends: 108 [2019-01-14 20:07:35,282 INFO L226 Difference]: Without dead ends: 108 [2019-01-14 20:07:35,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-14 20:07:35,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-14 20:07:35,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-14 20:07:35,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-14 20:07:35,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2019-01-14 20:07:35,288 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 47 [2019-01-14 20:07:35,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:07:35,288 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2019-01-14 20:07:35,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:07:35,288 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2019-01-14 20:07:35,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-14 20:07:35,289 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:07:35,289 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] [2019-01-14 20:07:35,290 INFO L423 AbstractCegarLoop]: === Iteration 17 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:07:35,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:07:35,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1508555054, now seen corresponding path program 1 times [2019-01-14 20:07:35,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:07:35,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:07:35,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:35,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:35,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:35,875 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-01-14 20:07:36,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:07:36,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:07:36,288 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 20:07:36,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:36,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:07:36,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:36,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:36,675 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 [2019-01-14 20:07:36,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:36,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:36,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:28 [2019-01-14 20:07:36,779 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 [2019-01-14 20:07:36,783 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 [2019-01-14 20:07:36,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:36,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:36,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:36,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2019-01-14 20:07:36,862 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 [2019-01-14 20:07:36,866 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 [2019-01-14 20:07:36,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:36,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:36,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:36,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2019-01-14 20:07:37,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:37,209 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 55 treesize of output 49 [2019-01-14 20:07:37,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:37,216 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 42 treesize of output 52 [2019-01-14 20:07:37,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:37,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:37,310 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. [2019-01-14 20:07:37,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:62 [2019-01-14 20:07:37,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:37,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:37,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:37,400 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 84 treesize of output 89 [2019-01-14 20:07:37,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:37,428 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 96 treesize of output 131 [2019-01-14 20:07:37,431 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 20:07:37,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:37,496 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. [2019-01-14 20:07:37,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:92 [2019-01-14 20:07:38,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:38,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:38,104 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 87 treesize of output 63 [2019-01-14 20:07:38,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:38,126 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 36 treesize of output 42 [2019-01-14 20:07:38,128 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 20:07:38,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:38,154 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 [2019-01-14 20:07:38,154 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:38,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:38,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:07:38,178 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:99, output treesize:15 [2019-01-14 20:07:38,366 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:07:38,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:07:38,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2019-01-14 20:07:38,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-14 20:07:38,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-14 20:07:38,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1849, Unknown=0, NotChecked=0, Total=1980 [2019-01-14 20:07:38,387 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand 45 states. [2019-01-14 20:07:39,521 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-01-14 20:07:39,952 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-01-14 20:07:41,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:07:41,315 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2019-01-14 20:07:41,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-14 20:07:41,316 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 48 [2019-01-14 20:07:41,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:07:41,317 INFO L225 Difference]: With dead ends: 137 [2019-01-14 20:07:41,317 INFO L226 Difference]: Without dead ends: 137 [2019-01-14 20:07:41,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=253, Invalid=2939, Unknown=0, NotChecked=0, Total=3192 [2019-01-14 20:07:41,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-14 20:07:41,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 112. [2019-01-14 20:07:41,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-14 20:07:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2019-01-14 20:07:41,326 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 48 [2019-01-14 20:07:41,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:07:41,326 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2019-01-14 20:07:41,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-14 20:07:41,326 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2019-01-14 20:07:41,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-14 20:07:41,329 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:07:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:07:41,330 INFO L423 AbstractCegarLoop]: === Iteration 18 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:07:41,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:07:41,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1508555055, now seen corresponding path program 1 times [2019-01-14 20:07:41,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:07:41,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:07:41,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:41,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:41,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:42,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:07:42,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:07:42,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 20:07:42,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:42,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:07:42,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:42,818 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 [2019-01-14 20:07:42,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:42,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:42,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:42,839 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 [2019-01-14 20:07:42,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:42,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:42,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2019-01-14 20:07:43,066 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 [2019-01-14 20:07:43,068 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 [2019-01-14 20:07:43,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:43,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:43,097 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 [2019-01-14 20:07:43,100 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 [2019-01-14 20:07:43,100 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:43,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:43,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:43,121 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2019-01-14 20:07:43,191 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 [2019-01-14 20:07:43,194 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 [2019-01-14 20:07:43,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:43,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:43,230 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 [2019-01-14 20:07:43,234 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 [2019-01-14 20:07:43,234 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:43,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:43,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:43,263 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:65 [2019-01-14 20:07:43,437 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 [2019-01-14 20:07:43,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:43,443 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 [2019-01-14 20:07:43,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:43,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:43,504 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 [2019-01-14 20:07:43,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:43,509 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 [2019-01-14 20:07:43,510 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:43,520 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:43,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:43,546 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:111, output treesize:95 [2019-01-14 20:07:43,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:43,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 [2019-01-14 20:07:43,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:43,651 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 [2019-01-14 20:07:43,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:43,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:43,730 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 [2019-01-14 20:07:43,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:43,735 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 [2019-01-14 20:07:43,736 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:43,749 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:43,782 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. [2019-01-14 20:07:43,783 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:146, output treesize:152 [2019-01-14 20:07:44,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:44,367 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 [2019-01-14 20:07:44,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:44,371 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 [2019-01-14 20:07:44,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:44,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:44,400 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 [2019-01-14 20:07:44,401 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:44,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:44,445 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 [2019-01-14 20:07:44,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:44,449 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 [2019-01-14 20:07:44,450 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:44,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:44,466 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 [2019-01-14 20:07:44,467 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:44,470 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:44,481 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. [2019-01-14 20:07:44,481 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:166, output treesize:23 [2019-01-14 20:07:44,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:07:44,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:07:44,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2019-01-14 20:07:44,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-14 20:07:44,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-14 20:07:44,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1862, Unknown=0, NotChecked=0, Total=1980 [2019-01-14 20:07:44,631 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand 45 states. [2019-01-14 20:07:46,608 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-01-14 20:07:46,835 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 95 [2019-01-14 20:07:49,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:07:49,321 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2019-01-14 20:07:49,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-14 20:07:49,322 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 48 [2019-01-14 20:07:49,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:07:49,324 INFO L225 Difference]: With dead ends: 138 [2019-01-14 20:07:49,324 INFO L226 Difference]: Without dead ends: 138 [2019-01-14 20:07:49,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=258, Invalid=3402, Unknown=0, NotChecked=0, Total=3660 [2019-01-14 20:07:49,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-14 20:07:49,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 112. [2019-01-14 20:07:49,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-14 20:07:49,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2019-01-14 20:07:49,331 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 48 [2019-01-14 20:07:49,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:07:49,331 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2019-01-14 20:07:49,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-14 20:07:49,332 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2019-01-14 20:07:49,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-14 20:07:49,332 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:07:49,332 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] [2019-01-14 20:07:49,333 INFO L423 AbstractCegarLoop]: === Iteration 19 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:07:49,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:07:49,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1172512454, now seen corresponding path program 2 times [2019-01-14 20:07:49,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:07:49,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:07:49,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:49,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:49,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:49,439 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 20:07:49,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:07:49,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 20:07:49,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 20:07:49,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 20:07:49,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:07:49,441 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand 7 states. [2019-01-14 20:07:49,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:07:49,503 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2019-01-14 20:07:49,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 20:07:49,504 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-01-14 20:07:49,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:07:49,505 INFO L225 Difference]: With dead ends: 104 [2019-01-14 20:07:49,505 INFO L226 Difference]: Without dead ends: 104 [2019-01-14 20:07:49,505 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 [2019-01-14 20:07:49,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-14 20:07:49,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-14 20:07:49,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-14 20:07:49,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2019-01-14 20:07:49,509 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 51 [2019-01-14 20:07:49,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:07:49,510 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2019-01-14 20:07:49,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 20:07:49,510 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2019-01-14 20:07:49,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-14 20:07:49,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:07:49,511 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] [2019-01-14 20:07:49,511 INFO L423 AbstractCegarLoop]: === Iteration 20 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:07:49,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:07:49,511 INFO L82 PathProgramCache]: Analyzing trace with hash 600462658, now seen corresponding path program 1 times [2019-01-14 20:07:49,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:07:49,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:07:49,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:49,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:07:49,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 20:07:50,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:07:50,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 20:07:50,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 20:07:50,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 20:07:50,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:07:50,031 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand 12 states. [2019-01-14 20:07:50,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:07:50,457 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2019-01-14 20:07:50,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 20:07:50,458 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2019-01-14 20:07:50,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:07:50,460 INFO L225 Difference]: With dead ends: 109 [2019-01-14 20:07:50,460 INFO L226 Difference]: Without dead ends: 109 [2019-01-14 20:07:50,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-14 20:07:50,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-14 20:07:50,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2019-01-14 20:07:50,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-14 20:07:50,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2019-01-14 20:07:50,464 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 58 [2019-01-14 20:07:50,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:07:50,465 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2019-01-14 20:07:50,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 20:07:50,465 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2019-01-14 20:07:50,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-14 20:07:50,465 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:07:50,466 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] [2019-01-14 20:07:50,466 INFO L423 AbstractCegarLoop]: === Iteration 21 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:07:50,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:07:50,466 INFO L82 PathProgramCache]: Analyzing trace with hash 600462659, now seen corresponding path program 1 times [2019-01-14 20:07:50,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:07:50,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:07:50,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:50,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:50,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:50,575 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-14 20:07:50,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:07:50,576 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 20:07:50,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:50,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:07:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-14 20:07:50,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:07:50,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 20:07:50,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 20:07:50,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 20:07:50,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 20:07:50,670 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand 5 states. [2019-01-14 20:07:50,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:07:50,769 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2019-01-14 20:07:50,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 20:07:50,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-01-14 20:07:50,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:07:50,772 INFO L225 Difference]: With dead ends: 114 [2019-01-14 20:07:50,772 INFO L226 Difference]: Without dead ends: 114 [2019-01-14 20:07:50,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:07:50,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-14 20:07:50,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-14 20:07:50,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-14 20:07:50,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2019-01-14 20:07:50,779 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 58 [2019-01-14 20:07:50,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:07:50,779 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2019-01-14 20:07:50,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 20:07:50,779 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2019-01-14 20:07:50,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-14 20:07:50,784 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:07:50,784 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] [2019-01-14 20:07:50,784 INFO L423 AbstractCegarLoop]: === Iteration 22 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:07:50,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:07:50,785 INFO L82 PathProgramCache]: Analyzing trace with hash -878279738, now seen corresponding path program 1 times [2019-01-14 20:07:50,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:07:50,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:07:50,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:50,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:50,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-14 20:07:51,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:07:51,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 20:07:51,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 20:07:51,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 20:07:51,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:07:51,057 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 7 states. [2019-01-14 20:07:51,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:07:51,142 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2019-01-14 20:07:51,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 20:07:51,144 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-01-14 20:07:51,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:07:51,145 INFO L225 Difference]: With dead ends: 108 [2019-01-14 20:07:51,145 INFO L226 Difference]: Without dead ends: 108 [2019-01-14 20:07:51,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-14 20:07:51,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-14 20:07:51,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-14 20:07:51,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-14 20:07:51,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2019-01-14 20:07:51,153 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 59 [2019-01-14 20:07:51,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:07:51,153 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2019-01-14 20:07:51,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 20:07:51,153 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2019-01-14 20:07:51,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-14 20:07:51,156 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:07:51,156 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] [2019-01-14 20:07:51,157 INFO L423 AbstractCegarLoop]: === Iteration 23 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:07:51,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:07:51,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1135279415, now seen corresponding path program 2 times [2019-01-14 20:07:51,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:07:51,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:07:51,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:51,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:51,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:51,309 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-14 20:07:51,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:07:51,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 20:07:51,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:07:51,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:07:51,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:07:51,310 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 6 states. [2019-01-14 20:07:51,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:07:51,375 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2019-01-14 20:07:51,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 20:07:51,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-01-14 20:07:51,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:07:51,378 INFO L225 Difference]: With dead ends: 122 [2019-01-14 20:07:51,378 INFO L226 Difference]: Without dead ends: 122 [2019-01-14 20:07:51,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 20:07:51,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-14 20:07:51,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2019-01-14 20:07:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-14 20:07:51,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2019-01-14 20:07:51,389 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 66 [2019-01-14 20:07:51,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:07:51,392 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2019-01-14 20:07:51,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:07:51,392 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2019-01-14 20:07:51,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-14 20:07:51,392 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:07:51,393 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] [2019-01-14 20:07:51,396 INFO L423 AbstractCegarLoop]: === Iteration 24 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:07:51,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:07:51,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1135279470, now seen corresponding path program 1 times [2019-01-14 20:07:51,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:07:51,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:07:51,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:51,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:07:51,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:51,793 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-14 20:07:51,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:07:51,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 20:07:51,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 20:07:51,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 20:07:51,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:07:51,795 INFO L87 Difference]: Start difference. First operand 118 states and 132 transitions. Second operand 12 states. [2019-01-14 20:07:52,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:07:52,166 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2019-01-14 20:07:52,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 20:07:52,168 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-01-14 20:07:52,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:07:52,171 INFO L225 Difference]: With dead ends: 123 [2019-01-14 20:07:52,171 INFO L226 Difference]: Without dead ends: 123 [2019-01-14 20:07:52,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-14 20:07:52,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-14 20:07:52,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2019-01-14 20:07:52,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-14 20:07:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2019-01-14 20:07:52,184 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 66 [2019-01-14 20:07:52,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:07:52,184 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2019-01-14 20:07:52,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 20:07:52,185 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2019-01-14 20:07:52,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-14 20:07:52,185 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:07:52,185 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] [2019-01-14 20:07:52,186 INFO L423 AbstractCegarLoop]: === Iteration 25 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:07:52,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:07:52,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1756746546, now seen corresponding path program 1 times [2019-01-14 20:07:52,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:07:52,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:07:52,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:52,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:52,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:07:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:52,781 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-01-14 20:07:53,612 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 20:07:53,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:07:53,613 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 20:07:53,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:07:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:07:53,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:07:53,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:53,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:53,783 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 [2019-01-14 20:07:53,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:53,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:53,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-01-14 20:07:53,845 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 [2019-01-14 20:07:53,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2019-01-14 20:07:53,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:53,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:53,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:53,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-01-14 20:07:53,902 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 [2019-01-14 20:07:53,919 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 [2019-01-14 20:07:53,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:53,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:53,931 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. [2019-01-14 20:07:53,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-14 20:07:54,021 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 [2019-01-14 20:07:54,025 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 [2019-01-14 20:07:54,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:54,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:54,043 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. [2019-01-14 20:07:54,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-14 20:07:54,089 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 [2019-01-14 20:07:54,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:54,093 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 [2019-01-14 20:07:54,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:07:54,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:07:54,106 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. [2019-01-14 20:07:54,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2019-01-14 20:07:55,276 WARN L181 SmtUtils]: Spent 836.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 20:07:55,285 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 [2019-01-14 20:07:55,309 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 [2019-01-14 20:07:55,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 20:07:55,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:07:55,349 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. [2019-01-14 20:07:55,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:78 [2019-01-14 20:07:55,424 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 [2019-01-14 20:07:55,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:07:55,428 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 [2019-01-14 20:07:55,429 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:07:55,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:07:55,443 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. [2019-01-14 20:07:55,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2019-01-14 20:08:05,657 WARN L181 SmtUtils]: Spent 575.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-14 20:08:05,669 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 [2019-01-14 20:08:05,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:05,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:05,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:05,676 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 [2019-01-14 20:08:05,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:08:05,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:08:05,702 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. [2019-01-14 20:08:05,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:36 [2019-01-14 20:08:05,926 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 [2019-01-14 20:08:05,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:05,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-01-14 20:08:05,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:08:05,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:08:05,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:08:05,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2019-01-14 20:08:06,058 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 20:08:06,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:08:06,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 50 [2019-01-14 20:08:06,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-14 20:08:06,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-14 20:08:06,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2390, Unknown=17, NotChecked=0, Total=2550 [2019-01-14 20:08:06,078 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand 51 states. [2019-01-14 20:08:08,977 WARN L181 SmtUtils]: Spent 734.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-14 20:08:10,767 WARN L181 SmtUtils]: Spent 568.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-14 20:08:13,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:08:13,444 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2019-01-14 20:08:13,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-14 20:08:13,445 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 69 [2019-01-14 20:08:13,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:08:13,447 INFO L225 Difference]: With dead ends: 154 [2019-01-14 20:08:13,447 INFO L226 Difference]: Without dead ends: 154 [2019-01-14 20:08:13,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 42 SyntacticMatches, 10 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=416, Invalid=5267, Unknown=17, NotChecked=0, Total=5700 [2019-01-14 20:08:13,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-14 20:08:13,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 126. [2019-01-14 20:08:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-14 20:08:13,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2019-01-14 20:08:13,454 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 69 [2019-01-14 20:08:13,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:08:13,454 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2019-01-14 20:08:13,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-14 20:08:13,454 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2019-01-14 20:08:13,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-14 20:08:13,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:08:13,455 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] [2019-01-14 20:08:13,456 INFO L423 AbstractCegarLoop]: === Iteration 26 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:08:13,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:08:13,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1756746545, now seen corresponding path program 1 times [2019-01-14 20:08:13,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:08:13,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:08:13,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:08:13,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:08:13,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:08:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:08:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:08:14,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:08:14,912 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 20:08:14,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:08:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:08:14,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:08:15,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:15,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:15,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 [2019-01-14 20:08:15,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:08:15,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:08:15,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-01-14 20:08:15,386 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 [2019-01-14 20:08:15,389 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 [2019-01-14 20:08:15,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:08:15,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:08:15,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:08:15,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-01-14 20:08:15,472 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 [2019-01-14 20:08:15,478 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 [2019-01-14 20:08:15,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:08:15,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:08:15,491 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. [2019-01-14 20:08:15,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-14 20:08:15,607 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 [2019-01-14 20:08:15,618 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 [2019-01-14 20:08:15,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:08:15,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:08:15,634 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. [2019-01-14 20:08:15,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-14 20:08:17,686 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2019-01-14 20:08:17,695 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 [2019-01-14 20:08:17,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:17,731 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 [2019-01-14 20:08:17,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:08:17,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:08:17,758 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 [2019-01-14 20:08:17,761 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 [2019-01-14 20:08:17,761 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:08:17,764 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:08:17,773 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. [2019-01-14 20:08:17,774 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:52 [2019-01-14 20:08:19,849 WARN L181 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 23 [2019-01-14 20:08:21,910 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-01-14 20:08:23,977 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-01-14 20:08:26,042 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-01-14 20:08:26,722 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 [2019-01-14 20:08:26,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2019-01-14 20:08:26,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:08:26,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:08:26,768 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 [2019-01-14 20:08:26,800 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 [2019-01-14 20:08:26,801 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2019-01-14 20:08:26,849 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 20:08:26,917 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. [2019-01-14 20:08:26,917 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:154, output treesize:283 [2019-01-14 20:08:27,129 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 [2019-01-14 20:08:27,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:27,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:27,168 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 [2019-01-14 20:08:27,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:08:27,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:08:27,210 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 [2019-01-14 20:08:27,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:27,216 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 [2019-01-14 20:08:27,218 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:08:27,230 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:08:27,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:27,320 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 [2019-01-14 20:08:27,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:27,323 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 [2019-01-14 20:08:27,324 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:08:27,335 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 [2019-01-14 20:08:27,336 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 20:08:27,343 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:08:27,370 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 [2019-01-14 20:08:27,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:27,374 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 [2019-01-14 20:08:27,375 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:08:27,384 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:08:27,403 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. [2019-01-14 20:08:27,404 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:139, output treesize:25 [2019-01-14 20:08:28,401 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_46 Int)) (<= 4 (select |c_#length| v_arrayElimCell_46))) (exists ((dll_circular_update_at_~head.offset Int)) (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_dll_circular_update_at_#in~head.base|) .cse0)))) (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))))) is different from true [2019-01-14 20:08:28,417 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 [2019-01-14 20:08:28,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:28,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:28,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:28,427 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 [2019-01-14 20:08:28,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:08:28,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:08:28,526 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 [2019-01-14 20:08:28,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:28,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:28,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:28,539 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 [2019-01-14 20:08:28,540 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:08:28,566 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:08:28,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:28,632 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 [2019-01-14 20:08:28,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:28,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:28,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:28,642 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 [2019-01-14 20:08:28,643 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:08:28,666 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:08:28,716 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 [2019-01-14 20:08:28,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:28,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:28,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:28,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:28,729 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 [2019-01-14 20:08:28,730 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 20:08:28,752 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:08:28,796 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. [2019-01-14 20:08:28,796 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:219, output treesize:135 [2019-01-14 20:08:29,091 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 [2019-01-14 20:08:29,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:29,095 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 [2019-01-14 20:08:29,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:08:29,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:08:29,142 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 [2019-01-14 20:08:29,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:29,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:29,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 33 treesize of output 28 [2019-01-14 20:08:29,154 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:08:29,165 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:08:29,192 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 [2019-01-14 20:08:29,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:29,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2019-01-14 20:08:29,198 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:08:29,212 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:08:29,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:29,240 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 [2019-01-14 20:08:29,251 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 [2019-01-14 20:08:29,251 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 20:08:29,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:08:29,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 18 [2019-01-14 20:08:29,265 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 20:08:29,273 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:08:29,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:08:29,394 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:155, output treesize:13 [2019-01-14 20:08:29,424 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2019-01-14 20:08:29,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:08:29,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 53 [2019-01-14 20:08:29,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-14 20:08:29,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-14 20:08:29,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2615, Unknown=1, NotChecked=102, Total=2862 [2019-01-14 20:08:29,457 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand 54 states. [2019-01-14 20:08:34,720 WARN L181 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-01-14 20:08:38,875 WARN L181 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-01-14 20:08:47,053 WARN L181 SmtUtils]: Spent 8.09 s on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-01-14 20:08:51,151 WARN L181 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-14 20:08:55,283 WARN L181 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-14 20:09:02,732 WARN L181 SmtUtils]: Spent 6.19 s on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-01-14 20:09:03,366 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-01-14 20:09:03,721 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-01-14 20:09:06,697 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-01-14 20:09:12,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:09:12,003 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2019-01-14 20:09:12,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-14 20:09:12,006 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 69 [2019-01-14 20:09:12,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:09:12,007 INFO L225 Difference]: With dead ends: 151 [2019-01-14 20:09:12,008 INFO L226 Difference]: Without dead ends: 151 [2019-01-14 20:09:12,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 46.9s TimeCoverageRelationStatistics Valid=398, Invalid=5767, Unknown=1, NotChecked=154, Total=6320 [2019-01-14 20:09:12,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-14 20:09:12,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 125. [2019-01-14 20:09:12,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-14 20:09:12,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 140 transitions. [2019-01-14 20:09:12,015 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 140 transitions. Word has length 69 [2019-01-14 20:09:12,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:09:12,016 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 140 transitions. [2019-01-14 20:09:12,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-14 20:09:12,016 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 140 transitions. [2019-01-14 20:09:12,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-14 20:09:12,016 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:09:12,017 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] [2019-01-14 20:09:12,017 INFO L423 AbstractCegarLoop]: === Iteration 27 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:09:12,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:09:12,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1756746490, now seen corresponding path program 1 times [2019-01-14 20:09:12,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:09:12,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:09:12,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:09:12,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:09:12,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:09:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:09:12,369 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-14 20:09:12,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:09:12,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 20:09:12,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 20:09:12,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 20:09:12,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:09:12,370 INFO L87 Difference]: Start difference. First operand 125 states and 140 transitions. Second operand 7 states. [2019-01-14 20:09:12,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:09:12,464 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2019-01-14 20:09:12,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 20:09:12,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-01-14 20:09:12,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:09:12,467 INFO L225 Difference]: With dead ends: 111 [2019-01-14 20:09:12,467 INFO L226 Difference]: Without dead ends: 111 [2019-01-14 20:09:12,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-14 20:09:12,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-14 20:09:12,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-14 20:09:12,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-14 20:09:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2019-01-14 20:09:12,471 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 69 [2019-01-14 20:09:12,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:09:12,471 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2019-01-14 20:09:12,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 20:09:12,471 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2019-01-14 20:09:12,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-14 20:09:12,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:09:12,472 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] [2019-01-14 20:09:12,472 INFO L423 AbstractCegarLoop]: === Iteration 28 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:09:12,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:09:12,473 INFO L82 PathProgramCache]: Analyzing trace with hash 493143767, now seen corresponding path program 1 times [2019-01-14 20:09:12,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:09:12,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:09:12,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:09:12,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:09:12,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:09:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:09:12,830 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-14 20:09:12,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:09:12,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 20:09:12,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 20:09:12,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 20:09:12,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:09:12,831 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand 12 states. [2019-01-14 20:09:13,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:09:13,243 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2019-01-14 20:09:13,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 20:09:13,245 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2019-01-14 20:09:13,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:09:13,246 INFO L225 Difference]: With dead ends: 131 [2019-01-14 20:09:13,247 INFO L226 Difference]: Without dead ends: 131 [2019-01-14 20:09:13,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-14 20:09:13,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-14 20:09:13,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 114. [2019-01-14 20:09:13,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-14 20:09:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2019-01-14 20:09:13,253 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 91 [2019-01-14 20:09:13,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:09:13,253 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2019-01-14 20:09:13,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 20:09:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2019-01-14 20:09:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-14 20:09:13,254 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:09:13,254 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] [2019-01-14 20:09:13,255 INFO L423 AbstractCegarLoop]: === Iteration 29 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:09:13,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:09:13,255 INFO L82 PathProgramCache]: Analyzing trace with hash 493143768, now seen corresponding path program 1 times [2019-01-14 20:09:13,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:09:13,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:09:13,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:09:13,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:09:13,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:09:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:09:14,167 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-14 20:09:14,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:09:14,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 20:09:14,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 20:09:14,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 20:09:14,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:09:14,168 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 12 states. [2019-01-14 20:09:14,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:09:14,633 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2019-01-14 20:09:14,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 20:09:14,634 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2019-01-14 20:09:14,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:09:14,636 INFO L225 Difference]: With dead ends: 112 [2019-01-14 20:09:14,636 INFO L226 Difference]: Without dead ends: 112 [2019-01-14 20:09:14,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-14 20:09:14,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-14 20:09:14,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-14 20:09:14,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-14 20:09:14,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2019-01-14 20:09:14,639 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 91 [2019-01-14 20:09:14,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:09:14,640 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2019-01-14 20:09:14,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 20:09:14,640 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2019-01-14 20:09:14,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-14 20:09:14,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:09:14,641 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] [2019-01-14 20:09:14,641 INFO L423 AbstractCegarLoop]: === Iteration 30 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:09:14,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:09:14,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1837028533, now seen corresponding path program 1 times [2019-01-14 20:09:14,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:09:14,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:09:14,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:09:14,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:09:14,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:09:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:09:14,976 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-14 20:09:14,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:09:14,977 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 20:09:14,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:09:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:09:15,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:09:15,102 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 [2019-01-14 20:09:15,104 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 [2019-01-14 20:09:15,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:15,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:15,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:15,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-01-14 20:09:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-14 20:09:15,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:09:15,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 11 [2019-01-14 20:09:15,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 20:09:15,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 20:09:15,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:09:15,135 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 12 states. [2019-01-14 20:09:15,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:09:15,585 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2019-01-14 20:09:15,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 20:09:15,586 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-01-14 20:09:15,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:09:15,588 INFO L225 Difference]: With dead ends: 129 [2019-01-14 20:09:15,588 INFO L226 Difference]: Without dead ends: 129 [2019-01-14 20:09:15,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 91 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-01-14 20:09:15,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-14 20:09:15,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 112. [2019-01-14 20:09:15,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-14 20:09:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2019-01-14 20:09:15,592 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 94 [2019-01-14 20:09:15,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:09:15,593 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2019-01-14 20:09:15,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 20:09:15,593 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2019-01-14 20:09:15,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-14 20:09:15,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:09:15,594 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] [2019-01-14 20:09:15,594 INFO L423 AbstractCegarLoop]: === Iteration 31 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:09:15,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:09:15,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1837028532, now seen corresponding path program 1 times [2019-01-14 20:09:15,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:09:15,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:09:15,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:09:15,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:09:15,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:09:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:09:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 20:09:16,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:09:16,747 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 20:09:16,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:09:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:09:16,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:09:17,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:17,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:17,240 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 [2019-01-14 20:09:17,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:17,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:17,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-01-14 20:09:17,335 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 [2019-01-14 20:09:17,347 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 [2019-01-14 20:09:17,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:17,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:17,367 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 [2019-01-14 20:09:17,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, 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 [2019-01-14 20:09:17,371 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:17,374 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:17,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:17,386 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2019-01-14 20:09:17,446 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 [2019-01-14 20:09:17,448 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 [2019-01-14 20:09:17,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:17,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:17,483 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 [2019-01-14 20:09:17,486 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 [2019-01-14 20:09:17,486 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:17,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:17,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:17,519 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-01-14 20:09:17,768 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 64 treesize of output 47 [2019-01-14 20:09:17,778 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 29 treesize of output 26 [2019-01-14 20:09:17,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:17,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:17,846 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 30 treesize of output 44 [2019-01-14 20:09:17,856 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 18 treesize of output 26 [2019-01-14 20:09:17,856 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:17,869 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:17,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:17,886 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:62 [2019-01-14 20:09:17,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:17,962 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 80 [2019-01-14 20:09:17,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:17,969 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 83 treesize of output 99 [2019-01-14 20:09:17,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:17,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:18,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:18,030 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 69 [2019-01-14 20:09:18,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:18,037 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 [2019-01-14 20:09:18,037 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:18,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:18,077 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. [2019-01-14 20:09:18,077 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:101, output treesize:109 [2019-01-14 20:09:19,369 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_$Pointer$.offset)| .cse0 (let ((.cse1 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))))) |c_#memory_$Pointer$.offset|)) is different from true [2019-01-14 20:09:19,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:19,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:19,378 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 [2019-01-14 20:09:19,404 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 [2019-01-14 20:09:19,409 INFO L267 ElimStorePlain]: Start of recursive call 3: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-01-14 20:09:20,411 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 0 case distinctions, treesize of input 66 treesize of output 52 [2019-01-14 20:09:20,411 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:20,488 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 72 [2019-01-14 20:09:20,490 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-14 20:09:20,515 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 76 treesize of output 76 [2019-01-14 20:09:20,516 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-14 20:09:20,546 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 1 case distinctions, treesize of input 76 treesize of output 68 [2019-01-14 20:09:20,548 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-01-14 20:09:20,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-01-14 20:09:20,849 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 [2019-01-14 20:09:20,875 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 27 treesize of output 35 [2019-01-14 20:09:20,876 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2019-01-14 20:09:20,912 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 20:09:20,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2019-01-14 20:09:20,965 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 27 treesize of output 35 [2019-01-14 20:09:20,966 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2019-01-14 20:09:21,003 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 20:09:21,009 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 [2019-01-14 20:09:21,036 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 27 treesize of output 35 [2019-01-14 20:09:21,038 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2019-01-14 20:09:21,075 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 20:09:21,081 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 [2019-01-14 20:09:21,129 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 27 treesize of output 35 [2019-01-14 20:09:21,130 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2019-01-14 20:09:21,164 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 20:09:21,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 13 xjuncts. [2019-01-14 20:09:21,413 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 4 variables, input treesize:132, output treesize:343 [2019-01-14 20:09:22,272 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base| (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_dll_circular_update_at_#in~head.base|) .cse0))))) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))) is different from true [2019-01-14 20:09:22,310 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 44 treesize of output 43 [2019-01-14 20:09:22,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:22,316 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 22 treesize of output 14 [2019-01-14 20:09:22,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:22,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:22,387 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 48 treesize of output 45 [2019-01-14 20:09:22,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:22,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:22,401 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 31 treesize of output 31 [2019-01-14 20:09:22,402 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:22,414 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:22,461 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 40 treesize of output 33 [2019-01-14 20:09:22,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:22,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:22,468 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 [2019-01-14 20:09:22,468 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:22,477 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:22,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 20:09:22,511 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:133, output treesize:67 [2019-01-14 20:09:23,899 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 40 [2019-01-14 20:09:24,680 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 52 treesize of output 42 [2019-01-14 20:09:24,697 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 [2019-01-14 20:09:24,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:24,708 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 24 treesize of output 15 [2019-01-14 20:09:24,708 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:24,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:24,756 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 44 treesize of output 40 [2019-01-14 20:09:24,759 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 [2019-01-14 20:09:24,760 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:24,767 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:24,804 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 [2019-01-14 20:09:24,807 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 [2019-01-14 20:09:24,807 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:24,814 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:24,848 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 33 treesize of output 25 [2019-01-14 20:09:24,851 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 [2019-01-14 20:09:24,851 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:24,855 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:24,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:24,876 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 11 variables, input treesize:145, output treesize:11 [2019-01-14 20:09:24,943 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2019-01-14 20:09:24,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:09:24,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 40] total 65 [2019-01-14 20:09:24,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-14 20:09:24,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-14 20:09:24,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3813, Unknown=8, NotChecked=250, Total=4290 [2019-01-14 20:09:24,964 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 66 states. [2019-01-14 20:09:26,294 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-01-14 20:09:26,540 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2019-01-14 20:09:28,977 WARN L181 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-01-14 20:09:30,333 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2019-01-14 20:09:30,958 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-01-14 20:09:32,376 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 81 [2019-01-14 20:09:32,644 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 76 [2019-01-14 20:09:33,682 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-01-14 20:09:33,942 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-01-14 20:09:34,499 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-14 20:09:35,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:09:35,146 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2019-01-14 20:09:35,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-14 20:09:35,148 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 94 [2019-01-14 20:09:35,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:09:35,149 INFO L225 Difference]: With dead ends: 126 [2019-01-14 20:09:35,149 INFO L226 Difference]: Without dead ends: 126 [2019-01-14 20:09:35,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 64 SyntacticMatches, 10 SemanticMatches, 93 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=621, Invalid=7935, Unknown=8, NotChecked=366, Total=8930 [2019-01-14 20:09:35,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-14 20:09:35,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2019-01-14 20:09:35,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-14 20:09:35,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2019-01-14 20:09:35,157 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 94 [2019-01-14 20:09:35,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:09:35,157 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2019-01-14 20:09:35,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-14 20:09:35,157 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2019-01-14 20:09:35,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-14 20:09:35,158 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:09:35,158 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] [2019-01-14 20:09:35,158 INFO L423 AbstractCegarLoop]: === Iteration 32 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:09:35,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:09:35,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1804537762, now seen corresponding path program 1 times [2019-01-14 20:09:35,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:09:35,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:09:35,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:09:35,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:09:35,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:09:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:09:35,351 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-14 20:09:35,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:09:35,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-14 20:09:35,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 20:09:35,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 20:09:35,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:09:35,352 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 12 states. [2019-01-14 20:09:35,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:09:35,571 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2019-01-14 20:09:35,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 20:09:35,573 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-01-14 20:09:35,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:09:35,575 INFO L225 Difference]: With dead ends: 116 [2019-01-14 20:09:35,575 INFO L226 Difference]: Without dead ends: 114 [2019-01-14 20:09:35,575 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 [2019-01-14 20:09:35,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-14 20:09:35,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-14 20:09:35,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-14 20:09:35,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2019-01-14 20:09:35,580 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 94 [2019-01-14 20:09:35,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:09:35,580 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2019-01-14 20:09:35,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 20:09:35,580 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2019-01-14 20:09:35,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-14 20:09:35,581 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:09:35,581 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] [2019-01-14 20:09:35,581 INFO L423 AbstractCegarLoop]: === Iteration 33 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:09:35,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:09:35,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1113311010, now seen corresponding path program 1 times [2019-01-14 20:09:35,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:09:35,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:09:35,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:09:35,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:09:35,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:09:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:09:35,935 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-14 20:09:35,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:09:35,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 20:09:35,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 20:09:35,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 20:09:35,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:09:35,937 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 12 states. [2019-01-14 20:09:36,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:09:36,238 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2019-01-14 20:09:36,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 20:09:36,240 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 95 [2019-01-14 20:09:36,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:09:36,244 INFO L225 Difference]: With dead ends: 113 [2019-01-14 20:09:36,244 INFO L226 Difference]: Without dead ends: 113 [2019-01-14 20:09:36,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-14 20:09:36,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-14 20:09:36,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-14 20:09:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-14 20:09:36,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2019-01-14 20:09:36,251 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 95 [2019-01-14 20:09:36,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:09:36,251 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2019-01-14 20:09:36,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 20:09:36,251 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2019-01-14 20:09:36,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-14 20:09:36,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:09:36,252 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:09:36,252 INFO L423 AbstractCegarLoop]: === Iteration 34 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:09:36,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:09:36,252 INFO L82 PathProgramCache]: Analyzing trace with hash -443599901, now seen corresponding path program 1 times [2019-01-14 20:09:36,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:09:36,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:09:36,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:09:36,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:09:36,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:09:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:09:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-14 20:09:38,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:09:38,325 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 20:09:38,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:09:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:09:38,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:09:38,470 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 [2019-01-14 20:09:38,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:38,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:38,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-01-14 20:09:38,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:38,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:38,581 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 [2019-01-14 20:09:38,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:38,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:38,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2019-01-14 20:09:38,661 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 [2019-01-14 20:09:38,664 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 [2019-01-14 20:09:38,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:38,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:38,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:38,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-01-14 20:09:38,724 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 [2019-01-14 20:09:38,727 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 [2019-01-14 20:09:38,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:38,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:38,745 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. [2019-01-14 20:09:38,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-01-14 20:09:38,853 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 [2019-01-14 20:09:38,857 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 [2019-01-14 20:09:38,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:38,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:38,879 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. [2019-01-14 20:09:38,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-01-14 20:09:38,930 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 [2019-01-14 20:09:38,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:38,937 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 [2019-01-14 20:09:38,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:38,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:38,958 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. [2019-01-14 20:09:38,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2019-01-14 20:09:39,190 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 [2019-01-14 20:09:39,192 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 [2019-01-14 20:09:39,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:39,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:39,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, 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 [2019-01-14 20:09:39,206 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:39,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:39,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:39,212 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:3 [2019-01-14 20:09:40,087 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_$Pointer$.base)| .cse0 (let ((.cse1 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))))))) is different from true [2019-01-14 20:09:40,094 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 [2019-01-14 20:09:40,110 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 [2019-01-14 20:09:40,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 20:09:40,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:09:40,156 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. [2019-01-14 20:09:40,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:78 [2019-01-14 20:09:40,237 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 [2019-01-14 20:09:40,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:40,241 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 [2019-01-14 20:09:40,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:40,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:40,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:40,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:3 [2019-01-14 20:09:40,836 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0)))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))) is different from true [2019-01-14 20:09:40,841 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 [2019-01-14 20:09:40,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:40,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:40,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:40,854 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 [2019-01-14 20:09:40,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:40,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:40,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:40,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:31 [2019-01-14 20:09:43,519 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 [2019-01-14 20:09:43,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:43,522 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 28 treesize of output 22 [2019-01-14 20:09:43,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 20:09:43,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:09:43,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:43,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2019-01-14 20:09:43,591 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 2 not checked. [2019-01-14 20:09:43,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:09:43,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33] total 53 [2019-01-14 20:09:43,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-14 20:09:43,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-14 20:09:43,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2507, Unknown=2, NotChecked=202, Total=2862 [2019-01-14 20:09:43,614 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 54 states. [2019-01-14 20:09:49,858 WARN L181 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2019-01-14 20:09:52,361 WARN L181 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 35 DAG size of output: 20 [2019-01-14 20:09:54,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:09:54,229 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2019-01-14 20:09:54,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-14 20:09:54,231 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 97 [2019-01-14 20:09:54,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:09:54,235 INFO L225 Difference]: With dead ends: 121 [2019-01-14 20:09:54,235 INFO L226 Difference]: Without dead ends: 121 [2019-01-14 20:09:54,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 69 SyntacticMatches, 12 SemanticMatches, 81 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1270 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=448, Invalid=6037, Unknown=3, NotChecked=318, Total=6806 [2019-01-14 20:09:54,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-14 20:09:54,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2019-01-14 20:09:54,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-14 20:09:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2019-01-14 20:09:54,244 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 97 [2019-01-14 20:09:54,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:09:54,244 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2019-01-14 20:09:54,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-14 20:09:54,244 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2019-01-14 20:09:54,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-14 20:09:54,245 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:09:54,245 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] [2019-01-14 20:09:54,246 INFO L423 AbstractCegarLoop]: === Iteration 35 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:09:54,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:09:54,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1064083314, now seen corresponding path program 1 times [2019-01-14 20:09:54,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:09:54,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:09:54,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:09:54,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:09:54,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:09:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:09:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-14 20:09:55,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:09:55,228 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 20:09:55,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:09:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:09:55,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:09:55,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:55,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:55,403 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 [2019-01-14 20:09:55,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:55,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:55,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-01-14 20:09:55,469 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 [2019-01-14 20:09:55,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:09:55,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:55,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:55,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:55,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-01-14 20:09:55,525 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 [2019-01-14 20:09:55,528 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 [2019-01-14 20:09:55,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:55,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:55,541 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. [2019-01-14 20:09:55,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-01-14 20:09:55,631 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 [2019-01-14 20:09:55,635 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 [2019-01-14 20:09:55,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:55,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:55,652 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. [2019-01-14 20:09:55,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2019-01-14 20:09:55,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-01-14 20:09:55,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:55,701 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 [2019-01-14 20:09:55,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:55,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:55,716 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. [2019-01-14 20:09:55,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2019-01-14 20:09:56,896 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_$Pointer$.base)| .cse0 (let ((.cse1 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))))))) is different from true [2019-01-14 20:09:56,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:56,902 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:09:56,910 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 [2019-01-14 20:09:56,925 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 [2019-01-14 20:09:56,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 20:09:56,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:09:56,966 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. [2019-01-14 20:09:56,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:60 [2019-01-14 20:09:57,621 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0)))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))) is different from true [2019-01-14 20:09:57,626 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 [2019-01-14 20:09:57,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:57,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:09:57,634 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 [2019-01-14 20:09:57,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:09:57,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:57,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:09:57,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:23 [2019-01-14 20:10:10,184 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 2 not checked. [2019-01-14 20:10:10,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:10:10,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 56 [2019-01-14 20:10:10,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-14 20:10:10,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-14 20:10:10,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2691, Unknown=2, NotChecked=210, Total=3080 [2019-01-14 20:10:10,205 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 56 states. [2019-01-14 20:10:34,102 WARN L181 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2019-01-14 20:10:42,456 WARN L181 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 32 DAG size of output: 20 [2019-01-14 20:10:45,887 WARN L181 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-01-14 20:10:46,497 WARN L181 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-01-14 20:10:46,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:10:46,906 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2019-01-14 20:10:46,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-14 20:10:46,909 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 100 [2019-01-14 20:10:46,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:10:46,910 INFO L225 Difference]: With dead ends: 117 [2019-01-14 20:10:46,911 INFO L226 Difference]: Without dead ends: 112 [2019-01-14 20:10:46,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 71 SyntacticMatches, 12 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1434 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=434, Invalid=5269, Unknown=5, NotChecked=298, Total=6006 [2019-01-14 20:10:46,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-14 20:10:46,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-01-14 20:10:46,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-14 20:10:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2019-01-14 20:10:46,918 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 100 [2019-01-14 20:10:46,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:10:46,919 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2019-01-14 20:10:46,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-14 20:10:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2019-01-14 20:10:46,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-14 20:10:46,920 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:10:46,920 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, 1] [2019-01-14 20:10:46,920 INFO L423 AbstractCegarLoop]: === Iteration 36 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:10:46,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:10:46,921 INFO L82 PathProgramCache]: Analyzing trace with hash 329925328, now seen corresponding path program 1 times [2019-01-14 20:10:46,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:10:46,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:10:46,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:10:46,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:10:46,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:10:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:10:48,775 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-14 20:10:48,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:10:48,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 20:10:48,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:10:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:10:48,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:10:48,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:48,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:48,996 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 [2019-01-14 20:10:48,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:10:49,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:49,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-01-14 20:10:49,029 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 [2019-01-14 20:10:49,031 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 [2019-01-14 20:10:49,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:10:49,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:49,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:49,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-01-14 20:10:49,106 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 [2019-01-14 20:10:49,110 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 [2019-01-14 20:10:49,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:10:49,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:49,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:49,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-01-14 20:10:49,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:49,447 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 [2019-01-14 20:10:49,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:49,451 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 [2019-01-14 20:10:49,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:10:49,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:49,604 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 12 [2019-01-14 20:10:49,608 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 [2019-01-14 20:10:49,608 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:10:49,610 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:49,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:49,625 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:51 [2019-01-14 20:10:49,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:49,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:49,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:49,722 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 [2019-01-14 20:10:49,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:49,751 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 [2019-01-14 20:10:49,753 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 20:10:49,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:49,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:49,839 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 32 [2019-01-14 20:10:49,847 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 [2019-01-14 20:10:49,848 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:10:49,858 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:49,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:49,872 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:73 [2019-01-14 20:10:51,394 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|)) (.cse1 (+ dll_circular_update_at_~head.offset 8))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)))) (= (store |c_old(#memory_$Pointer$.offset)| .cse0 (store (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) |c_#memory_$Pointer$.offset|) (<= (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|) dll_circular_update_at_~head.offset)))) is different from true [2019-01-14 20:10:51,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:51,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:51,402 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:10:51,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:51,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:51,412 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 119 treesize of output 145 [2019-01-14 20:10:51,474 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 111 [2019-01-14 20:10:51,480 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 14 xjuncts. [2019-01-14 20:10:51,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 20:10:51,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:51,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:51,663 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:10:51,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:51,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:51,669 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 84 treesize of output 125 [2019-01-14 20:10:51,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:51,691 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 57 treesize of output 55 [2019-01-14 20:10:51,693 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 20:10:51,848 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:51,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:51,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:51,855 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:10:51,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:51,860 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 84 treesize of output 104 [2019-01-14 20:10:51,870 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:10:51,887 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 36 treesize of output 43 [2019-01-14 20:10:51,891 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 20:10:51,938 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:51,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:51,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:51,946 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:10:51,954 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 98 treesize of output 112 [2019-01-14 20:10:51,968 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 30 treesize of output 17 [2019-01-14 20:10:51,969 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-01-14 20:10:51,992 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:10:52,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 20:10:52,057 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:136, output treesize:167 [2019-01-14 20:10:53,374 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_dll_circular_update_at_#in~head.base|) .cse0)))) (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset)))) is different from true [2019-01-14 20:10:53,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:53,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:53,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:53,388 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 94 treesize of output 126 [2019-01-14 20:10:53,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:53,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:53,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:53,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:53,428 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 60 treesize of output 82 [2019-01-14 20:10:53,430 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 20:10:53,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:53,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:53,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:53,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:53,682 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 75 treesize of output 96 [2019-01-14 20:10:53,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:53,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:53,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:53,713 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 75 treesize of output 95 [2019-01-14 20:10:53,714 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 20:10:53,783 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:53,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:53,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:53,904 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 91 treesize of output 106 [2019-01-14 20:10:53,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:53,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:53,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:53,938 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 66 treesize of output 84 [2019-01-14 20:10:53,940 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 20:10:53,989 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:54,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:54,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:54,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:54,097 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 104 treesize of output 119 [2019-01-14 20:10:54,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:54,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:54,135 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 90 treesize of output 117 [2019-01-14 20:10:54,137 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 20:10:54,199 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:54,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:54,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 88 [2019-01-14 20:10:54,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:54,302 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 22 treesize of output 14 [2019-01-14 20:10:54,302 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 20:10:54,324 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:54,404 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 72 treesize of output 65 [2019-01-14 20:10:54,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:54,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:54,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:54,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:54,420 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 29 treesize of output 45 [2019-01-14 20:10:54,421 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 20:10:54,445 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:54,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 20:10:54,508 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 9 variables, input treesize:290, output treesize:167 [2019-01-14 20:10:56,034 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 20:10:56,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:10:56,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:56,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:56,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 62 [2019-01-14 20:10:56,150 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 42 treesize of output 51 [2019-01-14 20:10:56,152 INFO L267 ElimStorePlain]: Start of recursive call 4: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-01-14 20:10:56,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:56,255 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 [2019-01-14 20:10:56,258 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2019-01-14 20:10:56,293 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 59 [2019-01-14 20:10:56,295 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2019-01-14 20:10:56,315 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 [2019-01-14 20:10:56,316 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-01-14 20:10:56,359 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 [2019-01-14 20:10:56,361 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 8 xjuncts. [2019-01-14 20:10:56,668 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 11 xjuncts. [2019-01-14 20:10:56,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:56,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:56,827 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 41 treesize of output 41 [2019-01-14 20:10:56,848 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 [2019-01-14 20:10:56,850 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-01-14 20:10:56,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:56,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:56,877 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 11 treesize of output 15 [2019-01-14 20:10:56,878 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 20:10:56,889 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:56,895 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 36 treesize of output 32 [2019-01-14 20:10:56,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:56,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 11 [2019-01-14 20:10:56,901 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 20:10:56,923 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 [2019-01-14 20:10:56,923 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2019-01-14 20:10:56,935 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:10:56,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:56,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:56,942 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 37 treesize of output 37 [2019-01-14 20:10:56,963 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 [2019-01-14 20:10:56,965 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-01-14 20:10:56,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:56,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:56,984 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 11 treesize of output 15 [2019-01-14 20:10:56,984 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 20:10:56,994 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:56,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:57,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:57,004 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 37 treesize of output 37 [2019-01-14 20:10:57,024 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 [2019-01-14 20:10:57,026 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-01-14 20:10:57,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:57,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:57,050 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 11 treesize of output 15 [2019-01-14 20:10:57,051 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 20:10:57,060 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:57,065 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 36 treesize of output 28 [2019-01-14 20:10:57,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:57,071 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 11 treesize of output 11 [2019-01-14 20:10:57,071 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 20:10:57,092 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 [2019-01-14 20:10:57,093 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2019-01-14 20:10:57,102 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:10:57,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:57,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:57,111 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 37 treesize of output 37 [2019-01-14 20:10:57,131 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 [2019-01-14 20:10:57,133 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-01-14 20:10:57,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:57,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:57,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 11 treesize of output 15 [2019-01-14 20:10:57,153 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 20:10:57,165 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:57,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:57,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:57,175 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 41 treesize of output 41 [2019-01-14 20:10:57,196 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 [2019-01-14 20:10:57,198 INFO L267 ElimStorePlain]: Start of recursive call 28: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-01-14 20:10:57,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:57,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:57,225 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 11 treesize of output 15 [2019-01-14 20:10:57,226 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 20:10:57,238 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:57,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:57,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:57,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2019-01-14 20:10:57,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:57,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:57,273 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 15 treesize of output 37 [2019-01-14 20:10:57,276 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 20:10:57,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, 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 [2019-01-14 20:10:57,294 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-14 20:10:57,301 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:57,306 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 36 treesize of output 28 [2019-01-14 20:10:57,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:57,319 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 11 treesize of output 11 [2019-01-14 20:10:57,320 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-01-14 20:10:57,350 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 [2019-01-14 20:10:57,350 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2019-01-14 20:10:57,359 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:10:57,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:57,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:57,369 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 41 treesize of output 41 [2019-01-14 20:10:57,388 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 [2019-01-14 20:10:57,390 INFO L267 ElimStorePlain]: Start of recursive call 37: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-01-14 20:10:57,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:57,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:57,416 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 11 treesize of output 15 [2019-01-14 20:10:57,417 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-01-14 20:10:57,426 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:10:57,429 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 36 treesize of output 28 [2019-01-14 20:10:57,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:10:57,434 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 11 treesize of output 11 [2019-01-14 20:10:57,435 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-01-14 20:10:57,449 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 [2019-01-14 20:10:57,450 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2019-01-14 20:10:57,458 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:10:57,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 20:10:57,718 INFO L202 ElimStorePlain]: Needed 41 recursive calls to eliminate 6 variables, input treesize:263, output treesize:43 [2019-01-14 20:10:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 2 not checked. [2019-01-14 20:10:58,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:10:58,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38] total 62 [2019-01-14 20:10:58,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-14 20:10:58,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-14 20:10:58,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=3361, Unknown=3, NotChecked=234, Total=3782 [2019-01-14 20:10:58,140 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 62 states. [2019-01-14 20:11:00,171 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 72 [2019-01-14 20:11:04,642 WARN L181 SmtUtils]: Spent 3.20 s on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-01-14 20:11:05,058 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-01-14 20:11:07,514 WARN L181 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 61 DAG size of output: 28 [2019-01-14 20:11:08,389 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-14 20:11:08,671 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-14 20:11:08,932 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-14 20:11:09,372 WARN L181 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 85 [2019-01-14 20:11:09,786 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 85 [2019-01-14 20:11:10,174 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2019-01-14 20:11:10,722 WARN L181 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-01-14 20:11:11,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:11:11,006 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-01-14 20:11:11,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-14 20:11:11,009 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 100 [2019-01-14 20:11:11,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:11:11,010 INFO L225 Difference]: With dead ends: 103 [2019-01-14 20:11:11,010 INFO L226 Difference]: Without dead ends: 103 [2019-01-14 20:11:11,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 65 SyntacticMatches, 15 SemanticMatches, 87 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1670 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=515, Invalid=6972, Unknown=3, NotChecked=342, Total=7832 [2019-01-14 20:11:11,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-14 20:11:11,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-14 20:11:11,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-14 20:11:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 106 transitions. [2019-01-14 20:11:11,014 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 106 transitions. Word has length 100 [2019-01-14 20:11:11,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:11:11,014 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 106 transitions. [2019-01-14 20:11:11,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-14 20:11:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 106 transitions. [2019-01-14 20:11:11,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-14 20:11:11,019 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:11:11,019 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] [2019-01-14 20:11:11,019 INFO L423 AbstractCegarLoop]: === Iteration 37 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:11:11,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:11:11,020 INFO L82 PathProgramCache]: Analyzing trace with hash -769380864, now seen corresponding path program 1 times [2019-01-14 20:11:11,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:11:11,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:11:11,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:11:11,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:11:11,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:11:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:11:12,265 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 20:11:12,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:11:12,266 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 20:11:12,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:11:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:11:12,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:11:12,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:11:12,551 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 [2019-01-14 20:11:12,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:11:12,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:11:12,577 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 [2019-01-14 20:11:12,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 20:11:12,600 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. [2019-01-14 20:11:12,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:38 [2019-01-14 20:11:12,720 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-14 20:11:12,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:11:12,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 7] total 40 [2019-01-14 20:11:12,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-14 20:11:12,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-14 20:11:12,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2019-01-14 20:11:12,740 INFO L87 Difference]: Start difference. First operand 103 states and 106 transitions. Second operand 41 states. [2019-01-14 20:11:15,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:11:15,339 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2019-01-14 20:11:15,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-14 20:11:15,340 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 102 [2019-01-14 20:11:15,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:11:15,341 INFO L225 Difference]: With dead ends: 102 [2019-01-14 20:11:15,341 INFO L226 Difference]: Without dead ends: 102 [2019-01-14 20:11:15,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=329, Invalid=3331, Unknown=0, NotChecked=0, Total=3660 [2019-01-14 20:11:15,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-14 20:11:15,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-14 20:11:15,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-14 20:11:15,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2019-01-14 20:11:15,346 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 102 [2019-01-14 20:11:15,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:11:15,346 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2019-01-14 20:11:15,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-14 20:11:15,346 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2019-01-14 20:11:15,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-14 20:11:15,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:11:15,347 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, 1, 1] [2019-01-14 20:11:15,348 INFO L423 AbstractCegarLoop]: === Iteration 38 === [dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2019-01-14 20:11:15,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:11:15,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1463468233, now seen corresponding path program 1 times [2019-01-14 20:11:15,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:11:15,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:11:15,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:11:15,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:11:15,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:11:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:11:15,785 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2019-01-14 20:11:16,076 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2019-01-14 20:11:16,530 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-01-14 20:11:17,638 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-14 20:11:17,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:11:17,638 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:11:17,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:11:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:11:17,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:11:18,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 20:11:18,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 20:11:18,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:40 [2019-01-14 20:11:18,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, 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 [2019-01-14 20:11:18,213 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 [2019-01-14 20:11:18,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:11:18,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:11:18,232 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. [2019-01-14 20:11:18,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:47 [2019-01-14 20:11:18,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:11:18,334 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 [2019-01-14 20:11:18,339 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 [2019-01-14 20:11:18,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:11:18,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:11:18,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 20:11:18,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:53 [2019-01-14 20:11:18,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:11:18,526 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 [2019-01-14 20:11:18,531 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 [2019-01-14 20:11:18,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:11:18,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:11:18,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 20:11:18,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:64, output treesize:60 [2019-01-14 20:11:18,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:11:18,640 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 52 treesize of output 50 [2019-01-14 20:11:18,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:11:18,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 47 treesize of output 62 [2019-01-14 20:11:18,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:11:18,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:11:18,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 20:11:18,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:75, output treesize:71 [2019-01-14 20:11:19,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:11:19,185 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 44 [2019-01-14 20:11:19,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:11:19,191 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:11:19,192 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 21 treesize of output 42 [2019-01-14 20:11:19,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:11:19,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:11:19,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2019-01-14 20:11:19,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:11:19,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-01-14 20:11:19,234 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:11:19,257 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 [2019-01-14 20:11:19,257 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 20:11:19,261 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:11:19,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 20:11:19,273 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:74, output treesize:18 [2019-01-14 20:11:26,674 WARN L181 SmtUtils]: Spent 865.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 20:11:26,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:11:26,686 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 79 treesize of output 79 [2019-01-14 20:11:26,705 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 [2019-01-14 20:11:26,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 20:11:26,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:11:26,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-14 20:11:26,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:116, output treesize:160 [2019-01-14 20:11:26,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:11:26,992 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 40 [2019-01-14 20:11:26,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:11:26,997 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:11:26,998 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 29 treesize of output 42 [2019-01-14 20:11:26,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:11:27,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:11:27,028 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 32 treesize of output 24 [2019-01-14 20:11:27,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:11:27,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-01-14 20:11:27,033 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:11:27,037 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:11:27,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 20:11:27,048 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:61, output treesize:18 [2019-01-14 20:11:36,078 WARN L181 SmtUtils]: Spent 638.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 20:11:36,127 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 54 treesize of output 43 [2019-01-14 20:11:36,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:11:36,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:11:36,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:11:36,167 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 43 treesize of output 55 [2019-01-14 20:11:36,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:11:36,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:11:36,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 20:11:36,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:94, output treesize:72 [2019-01-14 20:11:36,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:11:36,355 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 38 [2019-01-14 20:11:36,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:11:36,359 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:11:36,360 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 36 [2019-01-14 20:11:36,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:11:36,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:11:36,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 20:11:36,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:58, output treesize:42 [2019-01-14 20:11:36,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:11:36,708 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 48 [2019-01-14 20:11:36,712 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:11:36,712 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 29 treesize of output 42 [2019-01-14 20:11:36,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:11:36,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:11:36,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 20:11:36,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:58, output treesize:46 [2019-01-14 20:11:36,918 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 19 treesize of output 13 [2019-01-14 20:11:36,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:11:36,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 20:11:36,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:31 [2019-01-14 20:11:39,337 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2019-01-14 20:11:55,792 WARN L181 SmtUtils]: Spent 2.44 s on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 20:11:57,802 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((main_~s~0.offset Int) (v_main_~s~0.base_BEFORE_CALL_35 Int)) (let ((.cse0 (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_35))) (let ((.cse1 (select .cse0 main_~s~0.offset))) (and (= (select .cse0 (+ main_~s~0.offset 4)) .cse1) (not (= .cse1 v_main_~s~0.base_BEFORE_CALL_35)) (<= 0 main_~s~0.offset) (<= main_~s~0.offset 0))))) (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 [2019-01-14 20:11:57,816 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 75 treesize of output 67 [2019-01-14 20:11:57,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:11:57,849 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:11:57,850 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2019-01-14 20:11:57,851 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:11:57,901 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:11:57,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:11:57,904 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:11:57,905 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2019-01-14 20:11:57,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:11:57,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:11:57,944 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 48 treesize of output 46 [2019-01-14 20:11:57,944 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:11:57,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 20:11:58,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2019-01-14 20:11:58,018 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:101, output treesize:75 [2019-01-14 20:12:26,702 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 12 refuted. 2 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-14 20:12:26,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:12:26,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 36] total 64 [2019-01-14 20:12:26,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-14 20:12:26,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-14 20:12:26,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=3751, Unknown=53, NotChecked=124, Total=4160 [2019-01-14 20:12:26,723 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 65 states. [2019-01-14 20:12:48,596 WARN L181 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-01-14 20:12:54,085 WARN L181 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2019-01-14 20:12:54,885 WARN L181 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2019-01-14 20:13:01,440 WARN L181 SmtUtils]: Spent 724.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 20:13:17,116 WARN L181 SmtUtils]: Spent 674.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 20:13:39,133 WARN L181 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2019-01-14 20:13:50,149 WARN L181 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-01-14 20:13:56,494 WARN L181 SmtUtils]: Spent 5.09 s on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-01-14 20:14:03,136 WARN L181 SmtUtils]: Spent 5.33 s on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-01-14 20:14:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:14:04,537 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2019-01-14 20:14:04,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-14 20:14:04,537 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 106 [2019-01-14 20:14:04,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:14:04,538 INFO L225 Difference]: With dead ends: 101 [2019-01-14 20:14:04,538 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 20:14:04,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 78 SyntacticMatches, 11 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1957 ImplicationChecksByTransitivity, 100.0s TimeCoverageRelationStatistics Valid=468, Invalid=6445, Unknown=63, NotChecked=164, Total=7140 [2019-01-14 20:14:04,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 20:14:04,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 20:14:04,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 20:14:04,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 20:14:04,540 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2019-01-14 20:14:04,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:14:04,540 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 20:14:04,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-14 20:14:04,540 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 20:14:04,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 20:14:04,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 08:14:04 BoogieIcfgContainer [2019-01-14 20:14:04,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 20:14:04,546 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 20:14:04,546 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 20:14:04,547 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 20:14:04,547 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:07:19" (3/4) ... [2019-01-14 20:14:04,551 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 20:14:04,559 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 20:14:04,559 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-01-14 20:14:04,559 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_destroy [2019-01-14 20:14:04,559 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-14 20:14:04,560 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-14 20:14:04,560 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 20:14:04,560 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_create [2019-01-14 20:14:04,560 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_update_at [2019-01-14 20:14:04,560 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-01-14 20:14:04,560 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_get_data_at [2019-01-14 20:14:04,567 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2019-01-14 20:14:04,568 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-01-14 20:14:04,568 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 20:14:04,625 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 20:14:04,625 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 20:14:04,626 INFO L168 Benchmark]: Toolchain (without parser) took 407070.32 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 235.9 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -83.8 MB). Peak memory consumption was 152.1 MB. Max. memory is 11.5 GB. [2019-01-14 20:14:04,629 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 20:14:04,629 INFO L168 Benchmark]: CACSL2BoogieTranslator took 668.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2019-01-14 20:14:04,629 INFO L168 Benchmark]: Boogie Preprocessor took 98.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-14 20:14:04,630 INFO L168 Benchmark]: RCFGBuilder took 1053.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. [2019-01-14 20:14:04,630 INFO L168 Benchmark]: TraceAbstraction took 405165.39 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 101.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 13.6 MB). Peak memory consumption was 114.8 MB. Max. memory is 11.5 GB. [2019-01-14 20:14:04,630 INFO L168 Benchmark]: Witness Printer took 78.90 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.9 kB). Peak memory consumption was 6.9 kB. Max. memory is 11.5 GB. [2019-01-14 20:14:04,633 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 668.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 98.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1053.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 405165.39 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 101.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 13.6 MB). Peak memory consumption was 114.8 MB. Max. memory is 11.5 GB. * Witness Printer took 78.90 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.9 kB). Peak memory consumption was 6.9 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 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: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 615]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 610]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 610]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 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: 603]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 603]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 606]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 33 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 120 locations, 33 error locations. SAFE Result, 405.1s OverallTime, 38 OverallIterations, 3 TraceHistogramMax, 240.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2931 SDtfs, 3236 SDslu, 17592 SDs, 0 SdLazy, 30477 SolverSat, 872 SolverUnsat, 90 SolverUnknown, 0 SolverNotchecked, 130.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2015 GetRequests, 915 SyntacticMatches, 104 SemanticMatches, 996 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 12468 ImplicationChecksByTransitivity, 251.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred 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.2s AutomataMinimizationTime, 38 MinimizatonAttempts, 236 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 161.5s InterpolantComputationTime, 3404 NumberOfCodeBlocks, 3404 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 3349 ConstructedInterpolants, 290 QuantifiedInterpolants, 3893201 SizeOfPredicates, 274 NumberOfNonLiveVariables, 5697 ConjunctsInSsa, 1035 ConjunctsInUnsatCore, 55 InterpolantComputations, 21 PerfectInterpolantSequences, 728/1094 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...