./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef034042979fe1e524a3655a8992190a25335ff0 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:12:56,320 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:12:56,322 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:12:56,332 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:12:56,332 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:12:56,333 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:12:56,334 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:12:56,335 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:12:56,337 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:12:56,338 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:12:56,338 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:12:56,339 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:12:56,339 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:12:56,340 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:12:56,341 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:12:56,342 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:12:56,343 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:12:56,344 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:12:56,346 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:12:56,347 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:12:56,348 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:12:56,349 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:12:56,351 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:12:56,351 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:12:56,352 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:12:56,353 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:12:56,353 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:12:56,354 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:12:56,355 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:12:56,356 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:12:56,356 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:12:56,357 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:12:56,357 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:12:56,357 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:12:56,358 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:12:56,358 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:12:56,359 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 13:12:56,370 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:12:56,371 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:12:56,371 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:12:56,372 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:12:56,372 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:12:56,372 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:12:56,373 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:12:56,373 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:12:56,373 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:12:56,373 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:12:56,373 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:12:56,374 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:12:56,374 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:12:56,374 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 13:12:56,374 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 13:12:56,374 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 13:12:56,375 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:12:56,375 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:12:56,375 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:12:56,375 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:12:56,375 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:12:56,376 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:12:56,376 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:12:56,376 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:12:56,376 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:12:56,376 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:12:56,377 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:12:56,377 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:12:56,377 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ef034042979fe1e524a3655a8992190a25335ff0 [2018-11-28 13:12:56,407 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:12:56,418 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:12:56,422 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:12:56,423 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:12:56,424 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:12:56,424 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-28 13:12:56,482 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/data/edeae6556/30269bcd72bf4496b8286162fa4c7a29/FLAGa300762a9 [2018-11-28 13:12:56,909 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:12:56,910 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-28 13:12:56,921 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/data/edeae6556/30269bcd72bf4496b8286162fa4c7a29/FLAGa300762a9 [2018-11-28 13:12:56,935 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/data/edeae6556/30269bcd72bf4496b8286162fa4c7a29 [2018-11-28 13:12:56,938 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:12:56,940 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 13:12:56,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:12:56,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:12:56,944 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:12:56,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:12:56" (1/1) ... [2018-11-28 13:12:56,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff22a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:12:56, skipping insertion in model container [2018-11-28 13:12:56,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:12:56" (1/1) ... [2018-11-28 13:12:56,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:12:56,988 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:12:57,248 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:12:57,258 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:12:57,361 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:12:57,391 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:12:57,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:12:57 WrapperNode [2018-11-28 13:12:57,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:12:57,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:12:57,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:12:57,393 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:12:57,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:12:57" (1/1) ... [2018-11-28 13:12:57,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:12:57" (1/1) ... [2018-11-28 13:12:57,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:12:57" (1/1) ... [2018-11-28 13:12:57,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:12:57" (1/1) ... [2018-11-28 13:12:57,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:12:57" (1/1) ... [2018-11-28 13:12:57,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:12:57" (1/1) ... [2018-11-28 13:12:57,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:12:57" (1/1) ... [2018-11-28 13:12:57,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:12:57,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:12:57,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:12:57,447 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:12:57,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:12:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:12:57,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 13:12:57,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:12:57,494 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 13:12:57,494 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 13:12:57,494 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-11-28 13:12:57,494 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-28 13:12:57,494 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-28 13:12:57,494 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-28 13:12:57,495 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-11-28 13:12:57,495 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-11-28 13:12:57,495 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 13:12:57,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 13:12:57,495 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 13:12:57,495 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 13:12:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 13:12:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 13:12:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 13:12:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 13:12:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 13:12:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 13:12:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 13:12:57,497 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 13:12:57,497 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 13:12:57,497 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 13:12:57,497 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 13:12:57,497 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 13:12:57,497 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 13:12:57,497 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 13:12:57,497 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 13:12:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 13:12:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 13:12:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 13:12:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 13:12:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 13:12:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 13:12:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 13:12:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 13:12:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 13:12:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 13:12:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 13:12:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 13:12:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 13:12:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 13:12:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 13:12:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 13:12:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 13:12:57,500 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 13:12:57,500 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 13:12:57,500 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 13:12:57,500 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 13:12:57,500 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 13:12:57,500 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 13:12:57,500 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 13:12:57,501 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 13:12:57,501 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 13:12:57,501 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 13:12:57,501 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 13:12:57,501 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 13:12:57,501 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 13:12:57,501 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 13:12:57,501 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 13:12:57,502 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 13:12:57,502 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 13:12:57,502 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 13:12:57,502 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 13:12:57,502 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 13:12:57,502 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 13:12:57,502 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 13:12:57,502 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 13:12:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 13:12:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 13:12:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 13:12:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-28 13:12:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 13:12:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 13:12:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-28 13:12:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 13:12:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 13:12:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-28 13:12:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 13:12:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 13:12:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 13:12:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 13:12:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 13:12:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 13:12:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 13:12:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 13:12:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 13:12:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 13:12:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 13:12:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 13:12:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 13:12:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 13:12:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 13:12:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 13:12:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 13:12:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 13:12:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 13:12:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 13:12:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 13:12:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 13:12:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 13:12:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 13:12:57,507 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 13:12:57,507 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 13:12:57,507 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 13:12:57,507 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 13:12:57,507 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 13:12:57,507 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 13:12:57,507 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 13:12:57,507 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 13:12:57,507 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 13:12:57,508 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 13:12:57,508 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 13:12:57,508 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 13:12:57,508 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 13:12:57,508 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 13:12:57,508 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-11-28 13:12:57,508 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-28 13:12:57,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:12:57,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 13:12:57,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:12:57,509 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-28 13:12:57,509 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-28 13:12:57,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 13:12:57,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:12:57,509 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-11-28 13:12:57,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:12:57,510 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-11-28 13:12:57,510 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 13:12:57,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 13:12:57,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:12:57,934 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:12:57,934 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-28 13:12:57,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:12:57 BoogieIcfgContainer [2018-11-28 13:12:57,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:12:57,936 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:12:57,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:12:57,939 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:12:57,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:12:56" (1/3) ... [2018-11-28 13:12:57,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d40dc6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:12:57, skipping insertion in model container [2018-11-28 13:12:57,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:12:57" (2/3) ... [2018-11-28 13:12:57,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d40dc6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:12:57, skipping insertion in model container [2018-11-28 13:12:57,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:12:57" (3/3) ... [2018-11-28 13:12:57,944 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-28 13:12:57,953 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:12:57,960 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-11-28 13:12:57,972 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2018-11-28 13:12:57,990 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:12:57,991 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:12:57,991 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 13:12:57,991 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:12:57,991 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:12:57,991 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:12:57,991 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:12:57,992 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:12:57,992 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:12:58,008 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-11-28 13:12:58,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 13:12:58,017 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:58,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:58,019 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:12:58,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:58,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1323720086, now seen corresponding path program 1 times [2018-11-28 13:12:58,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:58,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:58,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:58,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:58,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:58,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:58,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:58,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:12:58,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:12:58,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:12:58,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:58,203 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2018-11-28 13:12:58,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:58,281 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-11-28 13:12:58,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:12:58,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-28 13:12:58,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:58,293 INFO L225 Difference]: With dead ends: 84 [2018-11-28 13:12:58,293 INFO L226 Difference]: Without dead ends: 77 [2018-11-28 13:12:58,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:58,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-28 13:12:58,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-28 13:12:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 13:12:58,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-11-28 13:12:58,335 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 13 [2018-11-28 13:12:58,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:58,336 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-11-28 13:12:58,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:12:58,336 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-11-28 13:12:58,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 13:12:58,336 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:58,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:58,337 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:12:58,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:58,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1323720085, now seen corresponding path program 1 times [2018-11-28 13:12:58,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:58,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:58,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:58,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:58,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:58,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:58,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:58,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:12:58,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:12:58,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:12:58,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:58,419 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 3 states. [2018-11-28 13:12:58,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:58,459 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-11-28 13:12:58,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:12:58,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-28 13:12:58,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:58,461 INFO L225 Difference]: With dead ends: 75 [2018-11-28 13:12:58,461 INFO L226 Difference]: Without dead ends: 75 [2018-11-28 13:12:58,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:12:58,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-28 13:12:58,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-28 13:12:58,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-28 13:12:58,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-11-28 13:12:58,470 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 13 [2018-11-28 13:12:58,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:58,471 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-11-28 13:12:58,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:12:58,471 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-11-28 13:12:58,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 13:12:58,472 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:58,472 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:58,472 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:12:58,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:58,473 INFO L82 PathProgramCache]: Analyzing trace with hash 303614154, now seen corresponding path program 1 times [2018-11-28 13:12:58,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:58,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:58,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:58,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:58,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:58,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:58,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:58,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:12:58,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:12:58,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:12:58,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:12:58,530 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2018-11-28 13:12:58,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:58,567 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2018-11-28 13:12:58,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:12:58,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-28 13:12:58,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:58,574 INFO L225 Difference]: With dead ends: 86 [2018-11-28 13:12:58,574 INFO L226 Difference]: Without dead ends: 83 [2018-11-28 13:12:58,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:12:58,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-28 13:12:58,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2018-11-28 13:12:58,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-28 13:12:58,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-11-28 13:12:58,586 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 18 [2018-11-28 13:12:58,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:58,587 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-11-28 13:12:58,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:12:58,587 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-11-28 13:12:58,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 13:12:58,589 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:58,589 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:58,589 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:12:58,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:58,590 INFO L82 PathProgramCache]: Analyzing trace with hash -677829022, now seen corresponding path program 1 times [2018-11-28 13:12:58,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:58,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:58,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:58,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:58,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:58,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:58,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:12:58,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:12:58,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:12:58,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:12:58,666 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 6 states. [2018-11-28 13:12:58,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:58,841 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-11-28 13:12:58,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:12:58,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-28 13:12:58,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:58,844 INFO L225 Difference]: With dead ends: 76 [2018-11-28 13:12:58,844 INFO L226 Difference]: Without dead ends: 76 [2018-11-28 13:12:58,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:12:58,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-28 13:12:58,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-11-28 13:12:58,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-28 13:12:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-11-28 13:12:58,849 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 19 [2018-11-28 13:12:58,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:58,850 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-11-28 13:12:58,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:12:58,850 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-11-28 13:12:58,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 13:12:58,851 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:58,851 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:58,851 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:12:58,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:58,851 INFO L82 PathProgramCache]: Analyzing trace with hash -677829021, now seen corresponding path program 1 times [2018-11-28 13:12:58,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:58,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:58,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:58,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:58,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:58,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:58,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:12:58,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:12:58,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:12:58,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:12:58,927 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 6 states. [2018-11-28 13:12:59,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:59,038 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-11-28 13:12:59,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:12:59,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-28 13:12:59,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:59,040 INFO L225 Difference]: With dead ends: 75 [2018-11-28 13:12:59,040 INFO L226 Difference]: Without dead ends: 75 [2018-11-28 13:12:59,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:12:59,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-28 13:12:59,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-11-28 13:12:59,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-28 13:12:59,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-11-28 13:12:59,046 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 19 [2018-11-28 13:12:59,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:59,046 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-11-28 13:12:59,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:12:59,046 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-11-28 13:12:59,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 13:12:59,047 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:59,047 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:59,048 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:12:59,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:59,048 INFO L82 PathProgramCache]: Analyzing trace with hash 649435046, now seen corresponding path program 1 times [2018-11-28 13:12:59,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:59,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:59,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:59,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:59,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:59,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:59,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:59,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 13:12:59,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 13:12:59,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 13:12:59,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:12:59,184 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 12 states. [2018-11-28 13:12:59,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:59,431 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-11-28 13:12:59,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:12:59,432 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-28 13:12:59,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:59,433 INFO L225 Difference]: With dead ends: 80 [2018-11-28 13:12:59,434 INFO L226 Difference]: Without dead ends: 80 [2018-11-28 13:12:59,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-11-28 13:12:59,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-28 13:12:59,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-11-28 13:12:59,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 13:12:59,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-11-28 13:12:59,442 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 31 [2018-11-28 13:12:59,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:59,443 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-11-28 13:12:59,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 13:12:59,443 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-11-28 13:12:59,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 13:12:59,444 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:59,444 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:12:59,444 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:12:59,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:59,445 INFO L82 PathProgramCache]: Analyzing trace with hash 649435047, now seen corresponding path program 1 times [2018-11-28 13:12:59,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:59,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:59,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:59,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:59,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:59,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:12:59,506 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:12:59,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:59,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:12:59,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:12:59,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:12:59,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 13:12:59,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:12:59,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:12:59,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:12:59,608 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 6 states. [2018-11-28 13:12:59,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:12:59,663 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-11-28 13:12:59,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:12:59,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-28 13:12:59,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:12:59,664 INFO L225 Difference]: With dead ends: 91 [2018-11-28 13:12:59,665 INFO L226 Difference]: Without dead ends: 88 [2018-11-28 13:12:59,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:12:59,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-28 13:12:59,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2018-11-28 13:12:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-28 13:12:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-11-28 13:12:59,669 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 31 [2018-11-28 13:12:59,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:12:59,669 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-11-28 13:12:59,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:12:59,670 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-11-28 13:12:59,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 13:12:59,671 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:12:59,671 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-28 13:12:59,671 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:12:59,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:12:59,671 INFO L82 PathProgramCache]: Analyzing trace with hash 40947275, now seen corresponding path program 2 times [2018-11-28 13:12:59,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:12:59,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:12:59,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:59,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:12:59,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:12:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:12:59,846 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 13:12:59,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:12:59,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 13:12:59,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 13:12:59,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 13:12:59,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:12:59,848 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 13 states. [2018-11-28 13:13:00,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:00,080 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-11-28 13:13:00,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 13:13:00,080 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-11-28 13:13:00,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:13:00,081 INFO L225 Difference]: With dead ends: 86 [2018-11-28 13:13:00,081 INFO L226 Difference]: Without dead ends: 86 [2018-11-28 13:13:00,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-28 13:13:00,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-28 13:13:00,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2018-11-28 13:13:00,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-28 13:13:00,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-11-28 13:13:00,087 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 44 [2018-11-28 13:13:00,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:13:00,087 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-11-28 13:13:00,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 13:13:00,087 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-11-28 13:13:00,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 13:13:00,088 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:13:00,089 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-28 13:13:00,089 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:13:00,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:00,089 INFO L82 PathProgramCache]: Analyzing trace with hash -2009121221, now seen corresponding path program 1 times [2018-11-28 13:13:00,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:00,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:00,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:00,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:13:00,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 13:13:00,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:00,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:13:00,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:13:00,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:13:00,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:13:00,180 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 9 states. [2018-11-28 13:13:00,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:00,335 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-11-28 13:13:00,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 13:13:00,336 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-11-28 13:13:00,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:13:00,337 INFO L225 Difference]: With dead ends: 94 [2018-11-28 13:13:00,337 INFO L226 Difference]: Without dead ends: 94 [2018-11-28 13:13:00,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:13:00,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-28 13:13:00,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2018-11-28 13:13:00,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-28 13:13:00,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-11-28 13:13:00,341 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 46 [2018-11-28 13:13:00,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:13:00,341 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-11-28 13:13:00,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:13:00,342 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-11-28 13:13:00,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 13:13:00,343 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:13:00,343 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-28 13:13:00,343 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:13:00,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:00,346 INFO L82 PathProgramCache]: Analyzing trace with hash -2009121220, now seen corresponding path program 1 times [2018-11-28 13:13:00,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:00,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:00,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:00,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:00,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:00,404 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 13:13:00,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:00,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:13:00,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:13:00,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:13:00,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:13:00,405 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 4 states. [2018-11-28 13:13:00,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:00,428 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2018-11-28 13:13:00,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:13:00,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-11-28 13:13:00,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:13:00,430 INFO L225 Difference]: With dead ends: 92 [2018-11-28 13:13:00,430 INFO L226 Difference]: Without dead ends: 92 [2018-11-28 13:13:00,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:13:00,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-28 13:13:00,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2018-11-28 13:13:00,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-28 13:13:00,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2018-11-28 13:13:00,435 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 46 [2018-11-28 13:13:00,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:13:00,435 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2018-11-28 13:13:00,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:13:00,436 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2018-11-28 13:13:00,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 13:13:00,437 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:13:00,437 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-28 13:13:00,437 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:13:00,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:00,437 INFO L82 PathProgramCache]: Analyzing trace with hash 91149112, now seen corresponding path program 1 times [2018-11-28 13:13:00,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:00,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:00,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:00,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:00,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:00,495 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 13:13:00,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:00,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:13:00,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:13:00,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:13:00,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:13:00,497 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 5 states. [2018-11-28 13:13:00,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:00,523 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2018-11-28 13:13:00,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:13:00,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-28 13:13:00,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:13:00,524 INFO L225 Difference]: With dead ends: 97 [2018-11-28 13:13:00,524 INFO L226 Difference]: Without dead ends: 97 [2018-11-28 13:13:00,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:13:00,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-28 13:13:00,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2018-11-28 13:13:00,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-28 13:13:00,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2018-11-28 13:13:00,528 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 47 [2018-11-28 13:13:00,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:13:00,528 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2018-11-28 13:13:00,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:13:00,529 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2018-11-28 13:13:00,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 13:13:00,530 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:13:00,530 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-28 13:13:00,530 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:13:00,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:00,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1790381074, now seen corresponding path program 1 times [2018-11-28 13:13:00,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:00,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:00,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:00,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:00,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:00,630 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 13:13:00,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:00,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 13:13:00,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 13:13:00,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 13:13:00,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:13:00,631 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 12 states. [2018-11-28 13:13:00,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:00,842 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2018-11-28 13:13:00,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:13:00,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-11-28 13:13:00,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:13:00,843 INFO L225 Difference]: With dead ends: 97 [2018-11-28 13:13:00,843 INFO L226 Difference]: Without dead ends: 97 [2018-11-28 13:13:00,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-11-28 13:13:00,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-28 13:13:00,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-11-28 13:13:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-28 13:13:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-11-28 13:13:00,847 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 54 [2018-11-28 13:13:00,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:13:00,847 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-11-28 13:13:00,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 13:13:00,848 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-11-28 13:13:00,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 13:13:00,848 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:13:00,849 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-28 13:13:00,849 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:13:00,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:00,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1790381075, now seen corresponding path program 1 times [2018-11-28 13:13:00,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:00,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:00,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:00,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:00,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 13:13:00,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:13:00,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:13:00,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:00,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:13:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 13:13:01,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:13:01,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-28 13:13:01,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:13:01,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:13:01,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:13:01,003 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 7 states. [2018-11-28 13:13:01,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:01,062 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2018-11-28 13:13:01,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:13:01,063 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-11-28 13:13:01,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:13:01,064 INFO L225 Difference]: With dead ends: 108 [2018-11-28 13:13:01,064 INFO L226 Difference]: Without dead ends: 108 [2018-11-28 13:13:01,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:13:01,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-28 13:13:01,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2018-11-28 13:13:01,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-28 13:13:01,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2018-11-28 13:13:01,068 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 54 [2018-11-28 13:13:01,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:13:01,069 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2018-11-28 13:13:01,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:13:01,069 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2018-11-28 13:13:01,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 13:13:01,069 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:13:01,070 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-28 13:13:01,070 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:13:01,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:01,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1855516484, now seen corresponding path program 1 times [2018-11-28 13:13:01,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:01,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:01,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:01,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:01,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 13:13:01,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:13:01,607 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:13:01,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:01,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:13:01,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:13:01,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:01,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:01,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 13:13:02,689 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-28 13:13:03,674 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-28 13:13:04,329 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-28 13:13:04,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 13:13:04,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:04,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:13:04,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2018-11-28 13:13:04,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 13:13:04,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 13:13:04,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:04,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:04,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:04,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-11-28 13:13:04,453 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 11 treesize of output 9 [2018-11-28 13:13:04,455 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-11-28 13:13:04,455 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:13:04,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:13:04,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:13:04,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-11-28 13:13:04,594 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 27 treesize of output 22 [2018-11-28 13:13:04,597 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:13:04,599 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 18 [2018-11-28 13:13:04,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:04,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:04,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:13:04,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:20 [2018-11-28 13:13:04,679 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 19 treesize of output 15 [2018-11-28 13:13:04,681 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:13:04,682 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 15 treesize of output 11 [2018-11-28 13:13:04,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:04,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:04,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:04,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:5 [2018-11-28 13:13:04,713 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 13:13:04,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:13:04,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 31 [2018-11-28 13:13:04,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-28 13:13:04,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-28 13:13:04,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=909, Unknown=5, NotChecked=0, Total=992 [2018-11-28 13:13:04,734 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand 32 states. [2018-11-28 13:13:05,559 WARN L180 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 22 [2018-11-28 13:13:06,247 WARN L180 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2018-11-28 13:13:07,001 WARN L180 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2018-11-28 13:13:08,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:08,476 INFO L93 Difference]: Finished difference Result 166 states and 189 transitions. [2018-11-28 13:13:08,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-28 13:13:08,477 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 55 [2018-11-28 13:13:08,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:13:08,478 INFO L225 Difference]: With dead ends: 166 [2018-11-28 13:13:08,478 INFO L226 Difference]: Without dead ends: 166 [2018-11-28 13:13:08,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 44 SyntacticMatches, 10 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=299, Invalid=2558, Unknown=5, NotChecked=0, Total=2862 [2018-11-28 13:13:08,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-28 13:13:08,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 117. [2018-11-28 13:13:08,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-28 13:13:08,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2018-11-28 13:13:08,484 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 55 [2018-11-28 13:13:08,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:13:08,484 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2018-11-28 13:13:08,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-28 13:13:08,484 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2018-11-28 13:13:08,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 13:13:08,485 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:13:08,485 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-28 13:13:08,485 INFO L423 AbstractCegarLoop]: === Iteration 15 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:13:08,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:08,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1855516485, now seen corresponding path program 1 times [2018-11-28 13:13:08,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:08,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:08,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:08,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:08,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:09,020 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 13:13:09,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:13:09,020 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:13:09,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:09,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:13:09,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:13:09,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:09,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:13:09,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:09,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:09,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-28 13:13:10,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:13:10,725 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:13:10,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 13:13:10,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:10,734 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 12 treesize of output 15 [2018-11-28 13:13:10,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:10,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:13:10,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2018-11-28 13:13:10,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 13:13:10,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 13:13:10,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:10,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:10,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 13:13:10,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 13:13:10,849 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:10,850 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:10,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:13:10,859 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:42 [2018-11-28 13:13:11,116 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 22 treesize of output 18 [2018-11-28 13:13:11,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 10 [2018-11-28 13:13:11,120 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:13:11,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:13:11,137 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 9 treesize of output 7 [2018-11-28 13:13:11,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-28 13:13:11,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:11,141 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:11,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:13:11,150 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:48, output treesize:21 [2018-11-28 13:13:11,323 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 37 treesize of output 30 [2018-11-28 13:13:11,331 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:13:11,337 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 28 [2018-11-28 13:13:11,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:11,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:11,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-28 13:13:11,370 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:13:11,371 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 16 [2018-11-28 13:13:11,372 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:11,377 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:11,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 13:13:11,388 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:86, output treesize:56 [2018-11-28 13:13:11,550 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 25 [2018-11-28 13:13:11,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 25 treesize of output 10 [2018-11-28 13:13:11,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:11,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:11,564 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 19 treesize of output 15 [2018-11-28 13:13:11,566 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 3 [2018-11-28 13:13:11,566 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:11,567 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:11,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:13:11,574 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:60, output treesize:18 [2018-11-28 13:13:11,671 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 13:13:11,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:13:11,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 43 [2018-11-28 13:13:11,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-28 13:13:11,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-28 13:13:11,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1775, Unknown=3, NotChecked=0, Total=1892 [2018-11-28 13:13:11,691 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand 44 states. [2018-11-28 13:13:14,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:14,415 INFO L93 Difference]: Finished difference Result 206 states and 236 transitions. [2018-11-28 13:13:14,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-28 13:13:14,415 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 55 [2018-11-28 13:13:14,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:13:14,417 INFO L225 Difference]: With dead ends: 206 [2018-11-28 13:13:14,417 INFO L226 Difference]: Without dead ends: 206 [2018-11-28 13:13:14,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=332, Invalid=3697, Unknown=3, NotChecked=0, Total=4032 [2018-11-28 13:13:14,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-28 13:13:14,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 131. [2018-11-28 13:13:14,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-28 13:13:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 155 transitions. [2018-11-28 13:13:14,425 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 155 transitions. Word has length 55 [2018-11-28 13:13:14,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:13:14,425 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 155 transitions. [2018-11-28 13:13:14,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-28 13:13:14,425 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 155 transitions. [2018-11-28 13:13:14,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 13:13:14,427 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:13:14,427 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:13:14,427 INFO L423 AbstractCegarLoop]: === Iteration 16 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:13:14,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:14,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1464096766, now seen corresponding path program 2 times [2018-11-28 13:13:14,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:14,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:14,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:14,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:14,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:14,494 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 13:13:14,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:13:14,495 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:13:14,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:13:14,552 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:13:14,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:13:14,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:13:14,562 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 13:13:14,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:13:14,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 13:13:14,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:13:14,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:13:14,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:13:14,586 INFO L87 Difference]: Start difference. First operand 131 states and 155 transitions. Second operand 7 states. [2018-11-28 13:13:14,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:14,640 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2018-11-28 13:13:14,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:13:14,641 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2018-11-28 13:13:14,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:13:14,642 INFO L225 Difference]: With dead ends: 112 [2018-11-28 13:13:14,642 INFO L226 Difference]: Without dead ends: 112 [2018-11-28 13:13:14,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:13:14,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-28 13:13:14,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-11-28 13:13:14,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-28 13:13:14,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2018-11-28 13:13:14,647 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 58 [2018-11-28 13:13:14,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:13:14,647 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2018-11-28 13:13:14,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:13:14,647 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2018-11-28 13:13:14,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-28 13:13:14,648 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:13:14,648 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:13:14,649 INFO L423 AbstractCegarLoop]: === Iteration 17 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:13:14,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:14,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1111258489, now seen corresponding path program 2 times [2018-11-28 13:13:14,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:14,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:14,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:14,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:13:14,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:14,726 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 13:13:14,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:13:14,726 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:13:14,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:13:14,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:13:14,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:13:14,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:13:14,806 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 13:13:14,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:13:14,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-28 13:13:14,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:13:14,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:13:14,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:13:14,826 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand 9 states. [2018-11-28 13:13:14,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:14,897 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2018-11-28 13:13:14,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:13:14,897 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2018-11-28 13:13:14,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:13:14,898 INFO L225 Difference]: With dead ends: 110 [2018-11-28 13:13:14,898 INFO L226 Difference]: Without dead ends: 104 [2018-11-28 13:13:14,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:13:14,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-28 13:13:14,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-28 13:13:14,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-28 13:13:14,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-11-28 13:13:14,901 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 62 [2018-11-28 13:13:14,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:13:14,902 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-11-28 13:13:14,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:13:14,902 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-11-28 13:13:14,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 13:13:14,903 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:13:14,903 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:13:14,903 INFO L423 AbstractCegarLoop]: === Iteration 18 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:13:14,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:14,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1030898547, now seen corresponding path program 1 times [2018-11-28 13:13:14,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:14,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:14,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:14,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:13:14,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:15,079 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 13:13:15,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:13:15,079 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:13:15,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:15,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:13:15,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:13:15,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:15,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:15,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 13:13:15,341 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 13:13:15,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:13:15,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 25 [2018-11-28 13:13:15,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-28 13:13:15,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-28 13:13:15,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-11-28 13:13:15,360 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 26 states. [2018-11-28 13:13:15,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:15,655 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2018-11-28 13:13:15,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 13:13:15,655 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 65 [2018-11-28 13:13:15,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:13:15,656 INFO L225 Difference]: With dead ends: 109 [2018-11-28 13:13:15,656 INFO L226 Difference]: Without dead ends: 109 [2018-11-28 13:13:15,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2018-11-28 13:13:15,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-28 13:13:15,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2018-11-28 13:13:15,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-28 13:13:15,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2018-11-28 13:13:15,660 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 65 [2018-11-28 13:13:15,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:13:15,660 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2018-11-28 13:13:15,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-28 13:13:15,661 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2018-11-28 13:13:15,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 13:13:15,661 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:13:15,661 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-28 13:13:15,662 INFO L423 AbstractCegarLoop]: === Iteration 19 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:13:15,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:15,662 INFO L82 PathProgramCache]: Analyzing trace with hash 295194122, now seen corresponding path program 3 times [2018-11-28 13:13:15,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:15,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:15,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:15,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:15,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:15,722 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 13:13:15,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:13:15,723 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:13:15,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 13:13:15,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-28 13:13:15,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:13:15,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:13:15,837 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 13:13:15,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:13:15,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2018-11-28 13:13:15,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 13:13:15,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 13:13:15,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:13:15,857 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 12 states. [2018-11-28 13:13:15,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:15,951 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2018-11-28 13:13:15,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:13:15,953 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-11-28 13:13:15,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:13:15,954 INFO L225 Difference]: With dead ends: 96 [2018-11-28 13:13:15,954 INFO L226 Difference]: Without dead ends: 96 [2018-11-28 13:13:15,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:13:15,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-28 13:13:15,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-11-28 13:13:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 13:13:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-11-28 13:13:15,957 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 66 [2018-11-28 13:13:15,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:13:15,958 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-11-28 13:13:15,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 13:13:15,958 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-11-28 13:13:15,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 13:13:15,959 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:13:15,959 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:13:15,959 INFO L423 AbstractCegarLoop]: === Iteration 20 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:13:15,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:15,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1814159334, now seen corresponding path program 1 times [2018-11-28 13:13:15,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:15,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:15,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:15,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:13:15,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:16,001 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-28 13:13:16,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:13:16,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:13:16,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:13:16,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:13:16,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:13:16,002 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 5 states. [2018-11-28 13:13:16,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:16,038 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-11-28 13:13:16,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:13:16,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-11-28 13:13:16,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:13:16,040 INFO L225 Difference]: With dead ends: 102 [2018-11-28 13:13:16,041 INFO L226 Difference]: Without dead ends: 102 [2018-11-28 13:13:16,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:13:16,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-28 13:13:16,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-11-28 13:13:16,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-28 13:13:16,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2018-11-28 13:13:16,047 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 68 [2018-11-28 13:13:16,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:13:16,047 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2018-11-28 13:13:16,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:13:16,047 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-11-28 13:13:16,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-28 13:13:16,048 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:13:16,048 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:13:16,049 INFO L423 AbstractCegarLoop]: === Iteration 21 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:13:16,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:16,049 INFO L82 PathProgramCache]: Analyzing trace with hash -2068123706, now seen corresponding path program 1 times [2018-11-28 13:13:16,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:16,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:16,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:16,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:16,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 13:13:16,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:13:16,945 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:13:16,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:16,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:13:16,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:13:16,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:16,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:17,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 13:13:17,219 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:13:17,220 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:13:17,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 13:13:17,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:17,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:17,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-28 13:13:17,286 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 13 treesize of output 10 [2018-11-28 13:13:17,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 13:13:17,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:17,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:17,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:17,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2018-11-28 13:13:18,396 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (and (<= sll_update_at_~head.offset |c_sll_update_at_#in~head.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset))) |c_#memory_$Pointer$.base|))) is different from true [2018-11-28 13:13:18,428 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 26 treesize of output 21 [2018-11-28 13:13:18,432 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:13:18,433 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 21 treesize of output 17 [2018-11-28 13:13:18,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:18,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:18,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:18,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:10 [2018-11-28 13:13:20,655 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 13:13:20,663 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 55 treesize of output 49 [2018-11-28 13:13:20,665 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 24 treesize of output 1 [2018-11-28 13:13:20,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:20,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:20,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:20,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:22 [2018-11-28 13:13:21,001 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 25 [2018-11-28 13:13:21,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 25 treesize of output 10 [2018-11-28 13:13:21,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:21,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:21,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:21,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:5 [2018-11-28 13:13:21,066 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 2 not checked. [2018-11-28 13:13:21,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:13:21,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 29] total 62 [2018-11-28 13:13:21,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-28 13:13:21,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-28 13:13:21,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=3632, Unknown=1, NotChecked=120, Total=3906 [2018-11-28 13:13:21,087 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 63 states. [2018-11-28 13:13:23,319 WARN L180 SmtUtils]: Spent 876.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-28 13:13:25,705 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 13:13:27,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:13:27,008 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2018-11-28 13:13:27,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-28 13:13:27,008 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 79 [2018-11-28 13:13:27,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:13:27,009 INFO L225 Difference]: With dead ends: 122 [2018-11-28 13:13:27,009 INFO L226 Difference]: Without dead ends: 122 [2018-11-28 13:13:27,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 94 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1584 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=506, Invalid=8427, Unknown=1, NotChecked=186, Total=9120 [2018-11-28 13:13:27,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-28 13:13:27,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 106. [2018-11-28 13:13:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-28 13:13:27,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2018-11-28 13:13:27,013 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 79 [2018-11-28 13:13:27,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:13:27,013 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-11-28 13:13:27,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-28 13:13:27,013 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2018-11-28 13:13:27,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-28 13:13:27,014 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:13:27,014 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:13:27,014 INFO L423 AbstractCegarLoop]: === Iteration 22 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:13:27,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:13:27,014 INFO L82 PathProgramCache]: Analyzing trace with hash -2068123705, now seen corresponding path program 1 times [2018-11-28 13:13:27,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:13:27,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:13:27,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:27,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:27,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:13:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:27,815 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 13:13:27,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:13:27,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:13:27,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:13:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:13:27,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:13:27,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:13:27,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:27,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:27,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 13:13:28,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:13:28,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:28,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:28,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-11-28 13:13:28,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:13:28,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:13:28,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 13:13:28,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:28,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:28,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:16 [2018-11-28 13:13:28,246 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 13 treesize of output 10 [2018-11-28 13:13:28,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 13:13:28,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:28,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:28,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:28,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-11-28 13:13:28,466 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 10 treesize of output 8 [2018-11-28 13:13:28,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 4 [2018-11-28 13:13:28,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:28,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:28,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:13:28,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:9 [2018-11-28 13:13:28,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-28 13:13:28,579 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 1 [2018-11-28 13:13:28,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:28,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:28,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:13:28,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:24 [2018-11-28 13:13:44,058 WARN L180 SmtUtils]: Spent 1.38 s on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 13:13:44,063 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 26 treesize of output 21 [2018-11-28 13:13:44,066 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:13:44,068 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 21 treesize of output 17 [2018-11-28 13:13:44,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:44,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:44,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:13:44,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-11-28 13:13:44,139 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 10 treesize of output 8 [2018-11-28 13:13:44,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 4 [2018-11-28 13:13:44,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:44,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:44,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:13:44,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:12 [2018-11-28 13:13:46,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:13:46,445 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 120 treesize of output 124 [2018-11-28 13:13:46,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 36 treesize of output 1 [2018-11-28 13:13:46,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:46,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:46,476 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 74 treesize of output 75 [2018-11-28 13:13:46,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2018-11-28 13:13:46,478 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:46,483 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:46,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:13:46,495 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:155, output treesize:62 [2018-11-28 13:13:54,798 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 39 treesize of output 33 [2018-11-28 13:13:54,801 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:13:54,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-11-28 13:13:54,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:54,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:54,826 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 26 [2018-11-28 13:13:54,829 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:13:54,830 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 26 treesize of output 18 [2018-11-28 13:13:54,830 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:13:54,851 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:13:54,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:13:54,879 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:75, output treesize:25 [2018-11-28 13:13:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 18 refuted. 2 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 13:13:57,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:13:57,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 58 [2018-11-28 13:13:57,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-28 13:13:57,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-28 13:13:57,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=3248, Unknown=17, NotChecked=0, Total=3422 [2018-11-28 13:13:57,969 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 59 states. [2018-11-28 13:14:33,348 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2018-11-28 13:15:02,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:15:02,930 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-11-28 13:15:02,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-28 13:15:02,931 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 79 [2018-11-28 13:15:02,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:15:02,932 INFO L225 Difference]: With dead ends: 123 [2018-11-28 13:15:02,932 INFO L226 Difference]: Without dead ends: 123 [2018-11-28 13:15:02,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 48.7s TimeCoverageRelationStatistics Valid=430, Invalid=6514, Unknown=28, NotChecked=0, Total=6972 [2018-11-28 13:15:02,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-28 13:15:02,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2018-11-28 13:15:02,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-28 13:15:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2018-11-28 13:15:02,935 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 79 [2018-11-28 13:15:02,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:15:02,935 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2018-11-28 13:15:02,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-28 13:15:02,936 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2018-11-28 13:15:02,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-28 13:15:02,936 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:15:02,936 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:15:02,937 INFO L423 AbstractCegarLoop]: === Iteration 23 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:15:02,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:15:02,937 INFO L82 PathProgramCache]: Analyzing trace with hash -2068123650, now seen corresponding path program 1 times [2018-11-28 13:15:02,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:15:02,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:15:02,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:15:02,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:15:02,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:15:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:15:02,985 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-28 13:15:02,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:15:02,985 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:15:03,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:15:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:15:03,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:15:03,059 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-28 13:15:03,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:15:03,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-28 13:15:03,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:15:03,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:15:03,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:15:03,077 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 8 states. [2018-11-28 13:15:03,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:15:03,127 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-11-28 13:15:03,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:15:03,128 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2018-11-28 13:15:03,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:15:03,129 INFO L225 Difference]: With dead ends: 96 [2018-11-28 13:15:03,129 INFO L226 Difference]: Without dead ends: 96 [2018-11-28 13:15:03,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:15:03,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-28 13:15:03,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-11-28 13:15:03,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 13:15:03,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-11-28 13:15:03,132 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 79 [2018-11-28 13:15:03,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:15:03,133 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-11-28 13:15:03,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:15:03,133 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-11-28 13:15:03,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-28 13:15:03,133 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:15:03,133 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, 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] [2018-11-28 13:15:03,134 INFO L423 AbstractCegarLoop]: === Iteration 24 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:15:03,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:15:03,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1402031402, now seen corresponding path program 1 times [2018-11-28 13:15:03,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:15:03,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:15:03,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:15:03,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:15:03,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:15:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:15:03,211 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 13:15:03,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:15:03,211 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:15:03,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:15:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:15:03,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:15:03,299 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-28 13:15:03,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:15:03,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-28 13:15:03,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:15:03,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:15:03,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:15:03,327 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 9 states. [2018-11-28 13:15:03,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:15:03,412 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2018-11-28 13:15:03,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:15:03,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-11-28 13:15:03,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:15:03,413 INFO L225 Difference]: With dead ends: 100 [2018-11-28 13:15:03,413 INFO L226 Difference]: Without dead ends: 96 [2018-11-28 13:15:03,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:15:03,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-28 13:15:03,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-11-28 13:15:03,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 13:15:03,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-11-28 13:15:03,415 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 87 [2018-11-28 13:15:03,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:15:03,416 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-11-28 13:15:03,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:15:03,416 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-11-28 13:15:03,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-28 13:15:03,416 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:15:03,416 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, 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] [2018-11-28 13:15:03,416 INFO L423 AbstractCegarLoop]: === Iteration 25 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:15:03,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:15:03,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1467646416, now seen corresponding path program 1 times [2018-11-28 13:15:03,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:15:03,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:15:03,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:15:03,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:15:03,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:15:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:15:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 13:15:03,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:15:03,611 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:15:03,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:15:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:15:03,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:15:03,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:15:03,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:03,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:03,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 13:15:03,932 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 13:15:03,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:15:03,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 25 [2018-11-28 13:15:03,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-28 13:15:03,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-28 13:15:03,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-11-28 13:15:03,949 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 26 states. [2018-11-28 13:15:04,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:15:04,234 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2018-11-28 13:15:04,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 13:15:04,235 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 90 [2018-11-28 13:15:04,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:15:04,235 INFO L225 Difference]: With dead ends: 102 [2018-11-28 13:15:04,235 INFO L226 Difference]: Without dead ends: 102 [2018-11-28 13:15:04,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 73 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2018-11-28 13:15:04,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-28 13:15:04,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2018-11-28 13:15:04,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-28 13:15:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2018-11-28 13:15:04,237 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 90 [2018-11-28 13:15:04,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:15:04,237 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2018-11-28 13:15:04,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-28 13:15:04,237 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2018-11-28 13:15:04,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 13:15:04,238 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:15:04,238 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, 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] [2018-11-28 13:15:04,238 INFO L423 AbstractCegarLoop]: === Iteration 26 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:15:04,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:15:04,238 INFO L82 PathProgramCache]: Analyzing trace with hash -114103981, now seen corresponding path program 1 times [2018-11-28 13:15:04,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:15:04,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:15:04,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:15:04,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:15:04,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:15:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:15:04,335 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 13:15:04,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:15:04,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 13:15:04,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 13:15:04,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 13:15:04,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:15:04,336 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand 12 states. [2018-11-28 13:15:04,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:15:04,470 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2018-11-28 13:15:04,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 13:15:04,471 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2018-11-28 13:15:04,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:15:04,472 INFO L225 Difference]: With dead ends: 101 [2018-11-28 13:15:04,472 INFO L226 Difference]: Without dead ends: 99 [2018-11-28 13:15:04,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:15:04,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-28 13:15:04,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-11-28 13:15:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-28 13:15:04,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2018-11-28 13:15:04,476 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 93 [2018-11-28 13:15:04,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:15:04,476 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2018-11-28 13:15:04,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 13:15:04,476 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2018-11-28 13:15:04,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 13:15:04,477 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:15:04,477 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, 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] [2018-11-28 13:15:04,477 INFO L423 AbstractCegarLoop]: === Iteration 27 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:15:04,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:15:04,477 INFO L82 PathProgramCache]: Analyzing trace with hash -944943971, now seen corresponding path program 1 times [2018-11-28 13:15:04,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:15:04,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:15:04,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:15:04,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:15:04,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:15:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:15:05,621 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 13:15:05,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:15:05,621 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:15:05,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:15:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:15:05,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:15:05,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:15:05,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:05,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:05,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 13:15:05,962 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:05,963 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:05,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 13:15:05,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:05,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:05,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-11-28 13:15:06,055 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 13 treesize of output 10 [2018-11-28 13:15:06,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 13:15:06,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:06,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:06,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:06,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-11-28 13:15:08,369 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (and (<= sll_update_at_~head.offset |c_sll_update_at_#in~head.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset))) |c_#memory_$Pointer$.base|))) is different from true [2018-11-28 13:15:08,375 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 26 treesize of output 21 [2018-11-28 13:15:08,377 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:08,380 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 21 treesize of output 17 [2018-11-28 13:15:08,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:08,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:08,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:08,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2018-11-28 13:15:09,571 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) (+ |c_sll_update_at_#in~head.offset| 4)))) (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| .cse0) sll_update_at_~head.offset)))))) is different from true [2018-11-28 13:15:09,577 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 44 treesize of output 38 [2018-11-28 13:15:09,579 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 24 treesize of output 1 [2018-11-28 13:15:09,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:09,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:09,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:09,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:17 [2018-11-28 13:15:11,587 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_23 Int) (v_main_~s~0.offset_BEFORE_CALL_23 Int)) (and (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_23) (+ v_main_~s~0.offset_BEFORE_CALL_23 4)) v_main_~s~0.base_BEFORE_CALL_23)) (<= 0 v_main_~s~0.offset_BEFORE_CALL_23) (<= v_main_~s~0.offset_BEFORE_CALL_23 0))) is different from true [2018-11-28 13:15:13,655 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_24 Int) (v_main_~s~0.offset_BEFORE_CALL_24 Int)) (and (<= 0 v_main_~s~0.offset_BEFORE_CALL_24) (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_24) (+ v_main_~s~0.offset_BEFORE_CALL_24 4)) v_main_~s~0.base_BEFORE_CALL_24)) (<= v_main_~s~0.offset_BEFORE_CALL_24 0))) is different from true [2018-11-28 13:15:17,707 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 13:15:18,455 WARN L180 SmtUtils]: Spent 700.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-28 13:15:19,201 WARN L180 SmtUtils]: Spent 697.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-28 13:15:21,255 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 24 [2018-11-28 13:15:21,455 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 25 [2018-11-28 13:15:21,463 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 1 case distinctions, treesize of input 25 treesize of output 22 [2018-11-28 13:15:21,464 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:15:21,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:15:21,504 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 2 xjuncts. [2018-11-28 13:15:21,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-11-28 13:15:21,689 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:21,689 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 12 treesize of output 21 [2018-11-28 13:15:21,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:21,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:15:21,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-11-28 13:15:21,755 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 9 not checked. [2018-11-28 13:15:21,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:15:21,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 37] total 76 [2018-11-28 13:15:21,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-11-28 13:15:21,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-11-28 13:15:21,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=5068, Unknown=5, NotChecked=580, Total=5852 [2018-11-28 13:15:21,773 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand 77 states. [2018-11-28 13:15:25,050 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 34 [2018-11-28 13:15:27,396 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 43 [2018-11-28 13:15:40,174 WARN L180 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2018-11-28 13:15:40,590 WARN L180 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-11-28 13:15:41,064 WARN L180 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2018-11-28 13:15:41,515 WARN L180 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2018-11-28 13:15:42,229 WARN L180 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2018-11-28 13:15:42,780 WARN L180 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2018-11-28 13:15:43,135 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-28 13:15:43,387 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-28 13:15:44,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:15:44,096 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-11-28 13:15:44,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-28 13:15:44,096 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 95 [2018-11-28 13:15:44,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:15:44,097 INFO L225 Difference]: With dead ends: 109 [2018-11-28 13:15:44,097 INFO L226 Difference]: Without dead ends: 109 [2018-11-28 13:15:44,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 65 SyntacticMatches, 10 SemanticMatches, 120 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3053 ImplicationChecksByTransitivity, 37.7s TimeCoverageRelationStatistics Valid=691, Invalid=13120, Unknown=11, NotChecked=940, Total=14762 [2018-11-28 13:15:44,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-28 13:15:44,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2018-11-28 13:15:44,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-28 13:15:44,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-11-28 13:15:44,101 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 95 [2018-11-28 13:15:44,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:15:44,101 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-11-28 13:15:44,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-11-28 13:15:44,102 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-11-28 13:15:44,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 13:15:44,102 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:15:44,102 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, 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] [2018-11-28 13:15:44,102 INFO L423 AbstractCegarLoop]: === Iteration 28 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:15:44,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:15:44,103 INFO L82 PathProgramCache]: Analyzing trace with hash -944943970, now seen corresponding path program 1 times [2018-11-28 13:15:44,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:15:44,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:15:44,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:15:44,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:15:44,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:15:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:15:45,852 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 11 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 13:15:45,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:15:45,853 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:15:45,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:15:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:15:45,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:15:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:15:45,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:45,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:15:45,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:45,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:45,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-28 13:15:46,368 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:46,368 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:15:46,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 13:15:46,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:46,377 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 12 treesize of output 15 [2018-11-28 13:15:46,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:46,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:46,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-11-28 13:15:46,513 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 13 treesize of output 10 [2018-11-28 13:15:46,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 13:15:46,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:46,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:46,533 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 13 treesize of output 10 [2018-11-28 13:15:46,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 13:15:46,535 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:46,538 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:46,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:46,549 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:48 [2018-11-28 13:15:46,875 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 19 treesize of output 15 [2018-11-28 13:15:46,877 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-28 13:15:46,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:15:46,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:15:46,888 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 22 treesize of output 18 [2018-11-28 13:15:46,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 10 [2018-11-28 13:15:46,893 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:15:46,896 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:15:46,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:15:46,905 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:21 [2018-11-28 13:16:03,399 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 37 [2018-11-28 13:16:03,406 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 34 treesize of output 27 [2018-11-28 13:16:03,409 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:16:03,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-11-28 13:16:03,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:03,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:03,434 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 37 treesize of output 30 [2018-11-28 13:16:03,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:16:03,437 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 28 [2018-11-28 13:16:03,437 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:03,444 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:03,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:16:03,456 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:98, output treesize:65 [2018-11-28 13:16:03,540 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 19 treesize of output 15 [2018-11-28 13:16:03,542 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-28 13:16:03,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:03,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:03,552 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 22 treesize of output 18 [2018-11-28 13:16:03,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 10 [2018-11-28 13:16:03,554 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:16:03,557 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:16:03,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:16:03,563 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:21 [2018-11-28 13:16:03,946 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 112 treesize of output 106 [2018-11-28 13:16:03,948 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 36 treesize of output 1 [2018-11-28 13:16:03,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:03,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:03,971 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 65 [2018-11-28 13:16:03,972 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 36 treesize of output 1 [2018-11-28 13:16:03,972 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:03,976 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:03,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:16:03,987 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:155, output treesize:65 [2018-11-28 13:16:04,806 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 25 [2018-11-28 13:16:04,815 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 1 case distinctions, treesize of input 25 treesize of output 22 [2018-11-28 13:16:04,816 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:16:04,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:16:04,840 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 28 treesize of output 22 [2018-11-28 13:16:04,847 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 19 [2018-11-28 13:16:04,847 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 13:16:04,865 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:16:04,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-11-28 13:16:04,880 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:69, output treesize:100 [2018-11-28 13:16:05,275 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 13:16:05,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:16:05,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 35] total 78 [2018-11-28 13:16:05,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-11-28 13:16:05,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-11-28 13:16:05,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=5927, Unknown=9, NotChecked=0, Total=6162 [2018-11-28 13:16:05,291 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 79 states. [2018-11-28 13:16:38,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:16:38,687 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2018-11-28 13:16:38,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-28 13:16:38,688 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 95 [2018-11-28 13:16:38,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:16:38,689 INFO L225 Difference]: With dead ends: 110 [2018-11-28 13:16:38,689 INFO L226 Difference]: Without dead ends: 110 [2018-11-28 13:16:38,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 61 SyntacticMatches, 10 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2154 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=695, Invalid=11952, Unknown=9, NotChecked=0, Total=12656 [2018-11-28 13:16:38,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-28 13:16:38,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2018-11-28 13:16:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-28 13:16:38,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-11-28 13:16:38,693 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 95 [2018-11-28 13:16:38,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:16:38,694 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-11-28 13:16:38,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-11-28 13:16:38,694 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-28 13:16:38,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 13:16:38,695 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:16:38,695 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:16:38,695 INFO L423 AbstractCegarLoop]: === Iteration 29 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:16:38,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:16:38,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1611562043, now seen corresponding path program 1 times [2018-11-28 13:16:38,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:16:38,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:16:38,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:16:38,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:16:38,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:16:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:16:39,461 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 13:16:39,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:16:39,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:16:39,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:16:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:16:39,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:16:39,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:16:39,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:39,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:39,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 13:16:39,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 13:16:39,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:16:39,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:39,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:39,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:39,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-11-28 13:16:39,807 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 27 treesize of output 22 [2018-11-28 13:16:39,809 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:16:39,811 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 [2018-11-28 13:16:39,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:39,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:39,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:39,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2018-11-28 13:16:39,956 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:16:39,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:16:39,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:16:39,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:38 [2018-11-28 13:16:40,555 WARN L180 SmtUtils]: Spent 548.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-28 13:16:41,128 WARN L180 SmtUtils]: Spent 523.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-28 13:16:41,132 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:16:41,136 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 24 treesize of output 25 [2018-11-28 13:16:41,138 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-28 13:16:41,140 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:16:41,141 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 23 [2018-11-28 13:16:41,142 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:41,146 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:41,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:41,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:41,164 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:60, output treesize:44 [2018-11-28 13:16:41,269 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 13 treesize of output 10 [2018-11-28 13:16:41,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 13:16:41,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:41,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:41,296 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 13 treesize of output 10 [2018-11-28 13:16:41,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 13:16:41,297 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:41,299 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:41,315 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:16:41,318 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 27 treesize of output 34 [2018-11-28 13:16:41,320 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 16 treesize of output 1 [2018-11-28 13:16:41,320 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:41,324 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:41,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:41,336 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:89, output treesize:80 [2018-11-28 13:16:41,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:16:41,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 58 [2018-11-28 13:16:41,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 46 [2018-11-28 13:16:41,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:41,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:41,704 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 41 treesize of output 35 [2018-11-28 13:16:41,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2018-11-28 13:16:41,706 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:16:41,710 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:16:41,721 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 13 treesize of output 11 [2018-11-28 13:16:41,723 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 13:16:41,723 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:16:41,725 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:16:41,736 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 7 treesize of output 5 [2018-11-28 13:16:41,737 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-28 13:16:41,737 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:41,738 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:41,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:16:41,747 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:94, output treesize:29 [2018-11-28 13:16:43,274 WARN L180 SmtUtils]: Spent 625.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-28 13:16:43,280 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 85 treesize of output 72 [2018-11-28 13:16:43,283 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:16:43,285 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 72 treesize of output 76 [2018-11-28 13:16:43,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:43,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:43,324 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:16:43,328 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 31 treesize of output 38 [2018-11-28 13:16:43,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:16:43,330 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:43,335 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:43,359 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 35 treesize of output 30 [2018-11-28 13:16:43,362 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:16:43,363 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 30 treesize of output 26 [2018-11-28 13:16:43,364 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:43,367 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:43,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:16:43,385 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:148, output treesize:88 [2018-11-28 13:16:43,484 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:16:43,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 58 [2018-11-28 13:16:43,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 46 [2018-11-28 13:16:43,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:43,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:43,507 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 19 treesize of output 11 [2018-11-28 13:16:43,509 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 13:16:43,509 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:43,510 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:43,520 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 22 treesize of output 18 [2018-11-28 13:16:43,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 10 [2018-11-28 13:16:43,522 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:16:43,525 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:16:43,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:16:43,542 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:94, output treesize:29 [2018-11-28 13:16:50,820 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 43 [2018-11-28 13:16:50,840 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 3 case distinctions, treesize of input 31 treesize of output 55 [2018-11-28 13:16:50,844 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 38 treesize of output 37 [2018-11-28 13:16:50,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:50,876 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 43 [2018-11-28 13:16:50,877 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 13:16:50,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:16:50,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:16:50,942 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 81 treesize of output 82 [2018-11-28 13:16:50,945 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 17 [2018-11-28 13:16:50,945 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:50,961 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:50,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 88 [2018-11-28 13:16:50,981 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 83 treesize of output 71 [2018-11-28 13:16:50,982 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:51,026 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 61 [2018-11-28 13:16:51,027 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:16:51,053 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:16:51,110 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:16:51,114 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 81 treesize of output 88 [2018-11-28 13:16:51,117 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 18 treesize of output 23 [2018-11-28 13:16:51,117 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:51,151 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:51,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 61 [2018-11-28 13:16:51,162 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2018-11-28 13:16:51,163 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:16:51,175 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:16:51,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 94 [2018-11-28 13:16:51,198 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 83 treesize of output 71 [2018-11-28 13:16:51,198 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:51,244 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 79 [2018-11-28 13:16:51,245 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:16:51,275 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:16:51,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 11 dim-0 vars, and 4 xjuncts. [2018-11-28 13:16:51,346 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:148, output treesize:298 [2018-11-28 13:16:55,677 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:16:55,678 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 53 treesize of output 44 [2018-11-28 13:16:55,680 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:16:55,680 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 23 treesize of output 39 [2018-11-28 13:16:55,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:55,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:55,711 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:16:55,711 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 36 treesize of output 39 [2018-11-28 13:16:55,713 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 23 treesize of output 15 [2018-11-28 13:16:55,713 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:16:55,721 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:16:55,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-28 13:16:55,738 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:88, output treesize:66 [2018-11-28 13:17:04,198 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:04,199 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 53 treesize of output 50 [2018-11-28 13:17:04,201 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 29 treesize of output 27 [2018-11-28 13:17:04,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:04,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:04,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:04,229 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 36 treesize of output 39 [2018-11-28 13:17:04,231 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 23 treesize of output 15 [2018-11-28 13:17:04,231 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:04,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:04,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-28 13:17:04,253 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:88, output treesize:66 [2018-11-28 13:17:16,827 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 95 treesize of output 93 [2018-11-28 13:17:16,829 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-28 13:17:16,830 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:16,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:16,850 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 106 treesize of output 104 [2018-11-28 13:17:16,852 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-28 13:17:16,853 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:16,872 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:16,996 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 106 treesize of output 98 [2018-11-28 13:17:16,998 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 13:17:16,998 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:17,013 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:17,020 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 1 case distinctions, treesize of input 95 treesize of output 99 [2018-11-28 13:17:17,022 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 93 [2018-11-28 13:17:17,023 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:17,069 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 89 [2018-11-28 13:17:17,069 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-28 13:17:17,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 82 [2018-11-28 13:17:17,121 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:17,169 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 13:17:17,332 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 77 [2018-11-28 13:17:17,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 4 [2018-11-28 13:17:17,334 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:17,354 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:17,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 113 [2018-11-28 13:17:17,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 105 [2018-11-28 13:17:17,515 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 8 xjuncts. [2018-11-28 13:17:17,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 95 [2018-11-28 13:17:17,765 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 8 xjuncts. [2018-11-28 13:17:17,941 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 99 [2018-11-28 13:17:17,942 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:18,238 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 89 [2018-11-28 13:17:18,238 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:18,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2018-11-28 13:17:18,375 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-11-28 13:17:18,507 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 83 [2018-11-28 13:17:18,508 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:18,755 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 94 [2018-11-28 13:17:18,755 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:18,881 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 101 [2018-11-28 13:17:18,882 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-11-28 13:17:19,017 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 90 [2018-11-28 13:17:19,018 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-11-28 13:17:19,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 89 [2018-11-28 13:17:19,135 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:19,245 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 85 [2018-11-28 13:17:19,246 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:19,337 INFO L267 ElimStorePlain]: Start of recursive call 14: 13 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-28 13:17:19,343 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 100 treesize of output 104 [2018-11-28 13:17:19,347 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 98 [2018-11-28 13:17:19,347 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:19,404 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 94 [2018-11-28 13:17:19,405 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-11-28 13:17:19,471 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 93 [2018-11-28 13:17:19,471 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:19,535 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 13:17:19,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 4 dim-2 vars, End of recursive call: 38 dim-0 vars, and 10 xjuncts. [2018-11-28 13:17:19,794 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 18 variables, input treesize:425, output treesize:763 [2018-11-28 13:17:24,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:24,910 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 61 treesize of output 59 [2018-11-28 13:17:24,966 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 13:17:24,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:24,970 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:24,971 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:24,972 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:24,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2018-11-28 13:17:24,973 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:24,974 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 13:17:24,975 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:24,977 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:24,978 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:24,979 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:24,982 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:24,984 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:24,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:24,987 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:24,988 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:24,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 63 [2018-11-28 13:17:24,989 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:25,003 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:25,011 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:25,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:25,014 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:25,015 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:25,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 54 [2018-11-28 13:17:25,017 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:25,019 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 13:17:25,019 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:25,023 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:25,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:25,027 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:25,028 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:25,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 44 [2018-11-28 13:17:25,029 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:25,032 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:25,033 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:25,035 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:25,036 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:25,037 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:25,038 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:25,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 42 [2018-11-28 13:17:25,039 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:25,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:25,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:25,080 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:87, output treesize:24 [2018-11-28 13:17:27,464 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-28 13:17:29,525 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2018-11-28 13:17:29,528 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 13:17:29,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:29,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:29,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:120, output treesize:1 [2018-11-28 13:17:29,582 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 13:17:29,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:17:29,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 48] total 79 [2018-11-28 13:17:29,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-11-28 13:17:29,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-11-28 13:17:29,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=5847, Unknown=18, NotChecked=0, Total=6162 [2018-11-28 13:17:29,598 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 79 states. [2018-11-28 13:17:33,301 WARN L180 SmtUtils]: Spent 969.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-11-28 13:17:34,318 WARN L180 SmtUtils]: Spent 944.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2018-11-28 13:17:50,466 WARN L180 SmtUtils]: Spent 556.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-28 13:17:53,730 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2018-11-28 13:18:06,098 WARN L180 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2018-11-28 13:18:38,002 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2018-11-28 13:19:33,866 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2018-11-28 13:20:04,389 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2018-11-28 13:20:06,468 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-28 13:20:08,536 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2018-11-28 13:20:11,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:20:11,881 INFO L93 Difference]: Finished difference Result 200 states and 207 transitions. [2018-11-28 13:20:11,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-11-28 13:20:11,881 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 98 [2018-11-28 13:20:11,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:20:11,882 INFO L225 Difference]: With dead ends: 200 [2018-11-28 13:20:11,882 INFO L226 Difference]: Without dead ends: 196 [2018-11-28 13:20:11,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6702 ImplicationChecksByTransitivity, 109.3s TimeCoverageRelationStatistics Valid=1209, Invalid=20185, Unknown=68, NotChecked=0, Total=21462 [2018-11-28 13:20:11,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-28 13:20:11,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 111. [2018-11-28 13:20:11,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-28 13:20:11,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions. [2018-11-28 13:20:11,887 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 98 [2018-11-28 13:20:11,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:20:11,888 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 114 transitions. [2018-11-28 13:20:11,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-11-28 13:20:11,888 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2018-11-28 13:20:11,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-28 13:20:11,888 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:20:11,888 INFO L402 BasicCegarLoop]: trace histogram [3, 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, 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] [2018-11-28 13:20:11,891 INFO L423 AbstractCegarLoop]: === Iteration 30 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:20:11,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:20:11,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1188097393, now seen corresponding path program 2 times [2018-11-28 13:20:11,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:20:11,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:20:11,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:11,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:20:11,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:20:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 13:20:13,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:20:13,489 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/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 [2018-11-28 13:20:13,496 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:20:13,533 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:20:13,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:20:13,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:20:13,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:20:13,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:13,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:20:13,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:13,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:13,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-28 13:20:13,740 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 3 [2018-11-28 13:20:13,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:13,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 13:20:13,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 13:20:13,749 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:13,751 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:13,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 [2018-11-28 13:20:13,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 13:20:13,759 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:13,760 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:13,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:13,765 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:50, output treesize:30 [2018-11-28 13:20:14,016 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:20:14,018 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:20:14,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 13:20:14,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:14,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-28 13:20:14,040 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-28 13:20:14,042 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:20:14,044 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 16 [2018-11-28 13:20:14,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:14,048 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:14,052 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:14,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-28 13:20:14,069 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-28 13:20:14,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:20:14,073 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 16 [2018-11-28 13:20:14,074 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:14,077 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:14,081 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:14,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:14,092 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:78, output treesize:50 [2018-11-28 13:20:14,221 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:20:14,222 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 32 treesize of output 31 [2018-11-28 13:20:14,224 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 9 [2018-11-28 13:20:14,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:14,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:14,239 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 32 treesize of output 31 [2018-11-28 13:20:14,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-28 13:20:14,241 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:14,245 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:14,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:20:14,252 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:73, output treesize:56 [2018-11-28 13:20:14,621 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 40 treesize of output 45 [2018-11-28 13:20:14,628 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 20 treesize of output 15 [2018-11-28 13:20:14,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:20:14,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:20:14,652 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 61 treesize of output 55 [2018-11-28 13:20:14,655 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 28 [2018-11-28 13:20:14,655 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:20:14,659 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:20:14,663 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 65 treesize of output 59 [2018-11-28 13:20:14,670 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 38 [2018-11-28 13:20:14,671 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:20:14,682 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:20:14,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-28 13:20:14,702 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:86, output treesize:122 [2018-11-28 13:20:15,047 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 135 [2018-11-28 13:20:15,059 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 101 [2018-11-28 13:20:15,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:20:15,213 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 117 treesize of output 101 [2018-11-28 13:20:15,213 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 13:20:15,352 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 110 treesize of output 74 [2018-11-28 13:20:15,353 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:15,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 13:20:15,486 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 85 treesize of output 84 [2018-11-28 13:20:15,487 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:20:15,488 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 44 treesize of output 11 [2018-11-28 13:20:15,488 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:15,494 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:15,516 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 117 [2018-11-28 13:20:15,519 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 85 treesize of output 49 [2018-11-28 13:20:15,519 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:15,597 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 72 treesize of output 56 [2018-11-28 13:20:15,597 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-28 13:20:15,627 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:20:15,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 67 treesize of output 58 [2018-11-28 13:20:15,634 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 30 treesize of output 1 [2018-11-28 13:20:15,634 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:15,639 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:15,700 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 146 treesize of output 195 [2018-11-28 13:20:15,712 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 154 treesize of output 138 [2018-11-28 13:20:15,713 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-28 13:20:16,044 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:20:16,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 165 [2018-11-28 13:20:16,060 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-11-28 13:20:16,221 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 137 treesize of output 101 [2018-11-28 13:20:16,221 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:16,295 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-28 13:20:16,391 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 86 [2018-11-28 13:20:16,394 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 77 treesize of output 78 [2018-11-28 13:20:16,395 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:20:16,404 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:20:16,411 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 108 [2018-11-28 13:20:16,412 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:20:16,414 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 44 treesize of output 47 [2018-11-28 13:20:16,414 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:16,421 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:16,427 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 84 [2018-11-28 13:20:16,430 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 75 treesize of output 58 [2018-11-28 13:20:16,430 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:16,438 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:16,460 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 120 [2018-11-28 13:20:16,464 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 118 treesize of output 82 [2018-11-28 13:20:16,465 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:16,545 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 99 treesize of output 118 [2018-11-28 13:20:16,546 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-11-28 13:20:16,610 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 4 case distinctions, treesize of input 85 treesize of output 88 [2018-11-28 13:20:16,611 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-28 13:20:16,663 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-28 13:20:16,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 7 xjuncts. [2018-11-28 13:20:16,743 INFO L202 ElimStorePlain]: Needed 26 recursive calls to eliminate 6 variables, input treesize:266, output treesize:409 [2018-11-28 13:20:18,611 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:20:18,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2018-11-28 13:20:18,615 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:20:18,615 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 42 treesize of output 28 [2018-11-28 13:20:18,616 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:20:18,627 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 15 treesize of output 12 [2018-11-28 13:20:18,627 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 13:20:18,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 13:20:18,651 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 35 treesize of output 29 [2018-11-28 13:20:18,656 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 15 treesize of output 12 [2018-11-28 13:20:18,656 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-28 13:20:18,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-28 13:20:18,663 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:18,667 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:20:18,669 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 38 [2018-11-28 13:20:18,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-28 13:20:18,672 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:18,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:20:18,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 13:20:18,680 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:18,684 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:18,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 13:20:18,697 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:82, output treesize:28 [2018-11-28 13:20:18,873 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 13:20:18,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:20:18,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41] total 69 [2018-11-28 13:20:18,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-11-28 13:20:18,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-11-28 13:20:18,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=4434, Unknown=12, NotChecked=0, Total=4692 [2018-11-28 13:20:18,891 INFO L87 Difference]: Start difference. First operand 111 states and 114 transitions. Second operand 69 states. [2018-11-28 13:20:24,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:20:24,368 INFO L93 Difference]: Finished difference Result 188 states and 195 transitions. [2018-11-28 13:20:24,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-28 13:20:24,368 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 100 [2018-11-28 13:20:24,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:20:24,369 INFO L225 Difference]: With dead ends: 188 [2018-11-28 13:20:24,369 INFO L226 Difference]: Without dead ends: 188 [2018-11-28 13:20:24,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 67 SyntacticMatches, 16 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2484 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=628, Invalid=9659, Unknown=15, NotChecked=0, Total=10302 [2018-11-28 13:20:24,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-28 13:20:24,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 169. [2018-11-28 13:20:24,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-11-28 13:20:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 176 transitions. [2018-11-28 13:20:24,374 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 176 transitions. Word has length 100 [2018-11-28 13:20:24,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:20:24,375 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 176 transitions. [2018-11-28 13:20:24,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-11-28 13:20:24,375 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 176 transitions. [2018-11-28 13:20:24,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 13:20:24,376 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:20:24,376 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, 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] [2018-11-28 13:20:24,376 INFO L423 AbstractCegarLoop]: === Iteration 31 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:20:24,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:20:24,376 INFO L82 PathProgramCache]: Analyzing trace with hash 214671507, now seen corresponding path program 2 times [2018-11-28 13:20:24,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:20:24,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:20:24,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:24,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:20:24,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:20:25,365 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 13:20:25,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:20:25,365 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:20:25,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:20:25,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:20:25,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:20:25,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:20:25,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 13:20:25,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:20:25,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:25,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:25,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:25,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:42 [2018-11-28 13:20:25,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:20:25,885 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 30 treesize of output 37 [2018-11-28 13:20:25,888 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 29 treesize of output 18 [2018-11-28 13:20:25,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:25,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:25,900 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 18 treesize of output 14 [2018-11-28 13:20:25,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 10 [2018-11-28 13:20:25,903 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:20:25,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:20:25,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:20:25,910 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:18 [2018-11-28 13:20:33,814 WARN L180 SmtUtils]: Spent 511.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-28 13:20:33,818 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 52 treesize of output 43 [2018-11-28 13:20:33,826 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 36 [2018-11-28 13:20:33,826 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:20:33,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:20:33,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-28 13:20:33,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:104 [2018-11-28 13:20:33,984 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:20:33,985 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 46 treesize of output 39 [2018-11-28 13:20:33,987 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:20:33,987 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 23 treesize of output 28 [2018-11-28 13:20:33,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:33,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:34,006 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:20:34,006 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 34 treesize of output 37 [2018-11-28 13:20:34,008 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 25 treesize of output 10 [2018-11-28 13:20:34,008 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:34,012 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:34,022 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 26 treesize of output 22 [2018-11-28 13:20:34,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 10 [2018-11-28 13:20:34,023 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:20:34,028 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:20:34,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-28 13:20:34,037 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:79, output treesize:37 [2018-11-28 13:20:52,546 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 13:20:52,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 87 [2018-11-28 13:20:52,568 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 81 treesize of output 57 [2018-11-28 13:20:52,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:52,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:52,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, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 90 [2018-11-28 13:20:52,642 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 90 treesize of output 66 [2018-11-28 13:20:52,642 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:52,677 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:20:52,680 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:20:52,691 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 4 case distinctions, treesize of input 73 treesize of output 80 [2018-11-28 13:20:52,692 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-28 13:20:52,737 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:20:52,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-11-28 13:20:52,784 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:170, output treesize:163 [2018-11-28 13:20:52,984 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:20:52,984 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 44 treesize of output 41 [2018-11-28 13:20:52,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:20:52,986 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 19 treesize of output 16 [2018-11-28 13:20:52,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:52,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:53,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:20:53,014 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 43 treesize of output 36 [2018-11-28 13:20:53,016 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:20:53,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-11-28 13:20:53,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:53,020 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:53,037 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:20:53,038 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 31 treesize of output 34 [2018-11-28 13:20:53,039 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 25 treesize of output 10 [2018-11-28 13:20:53,039 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:53,042 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:53,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-28 13:20:53,055 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:116, output treesize:67 [2018-11-28 13:20:53,272 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:20:53,273 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 43 treesize of output 42 [2018-11-28 13:20:53,274 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 29 treesize of output 18 [2018-11-28 13:20:53,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:53,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:53,301 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:20:53,301 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 44 treesize of output 41 [2018-11-28 13:20:53,303 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:20:53,303 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 19 treesize of output 16 [2018-11-28 13:20:53,304 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:53,309 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:53,327 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:20:53,328 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 31 treesize of output 34 [2018-11-28 13:20:53,329 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 25 treesize of output 10 [2018-11-28 13:20:53,329 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:53,332 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:20:53,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-28 13:20:53,346 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:116, output treesize:67 [2018-11-28 13:20:53,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:20:53,784 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 42 treesize of output 34 [2018-11-28 13:20:53,786 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-11-28 13:20:53,786 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:20:53,790 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:20:53,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:20:53,794 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:55, output treesize:26 [2018-11-28 13:21:04,979 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 23 refuted. 2 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 13:21:04,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:21:04,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34] total 61 [2018-11-28 13:21:04,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-28 13:21:04,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-28 13:21:04,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=3547, Unknown=34, NotChecked=0, Total=3782 [2018-11-28 13:21:04,994 INFO L87 Difference]: Start difference. First operand 169 states and 176 transitions. Second operand 62 states. [2018-11-28 13:21:43,469 WARN L180 SmtUtils]: Spent 2.86 s on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2018-11-28 13:21:55,829 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-28 13:22:04,176 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-28 13:22:12,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:12,536 INFO L93 Difference]: Finished difference Result 183 states and 191 transitions. [2018-11-28 13:22:12,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-28 13:22:12,536 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 103 [2018-11-28 13:22:12,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:12,536 INFO L225 Difference]: With dead ends: 183 [2018-11-28 13:22:12,536 INFO L226 Difference]: Without dead ends: 128 [2018-11-28 13:22:12,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 77 SyntacticMatches, 11 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1649 ImplicationChecksByTransitivity, 51.7s TimeCoverageRelationStatistics Valid=513, Invalid=7640, Unknown=37, NotChecked=0, Total=8190 [2018-11-28 13:22:12,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-28 13:22:12,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2018-11-28 13:22:12,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-28 13:22:12,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2018-11-28 13:22:12,539 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 103 [2018-11-28 13:22:12,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:12,540 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2018-11-28 13:22:12,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-28 13:22:12,540 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2018-11-28 13:22:12,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-28 13:22:12,540 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:12,540 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-28 13:22:12,541 INFO L423 AbstractCegarLoop]: === Iteration 32 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 13:22:12,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:12,541 INFO L82 PathProgramCache]: Analyzing trace with hash 376668779, now seen corresponding path program 3 times [2018-11-28 13:22:12,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:22:12,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:22:12,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:12,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:22:12,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:12,610 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-28 13:22:12,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:22:12,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:22:12,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 13:22:12,723 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 13:22:12,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:22:12,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:22:12,738 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-28 13:22:12,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:22:12,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 13:22:12,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:22:12,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:22:12,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:22:12,753 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand 7 states. [2018-11-28 13:22:12,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:12,771 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-11-28 13:22:12,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:22:12,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-11-28 13:22:12,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:12,771 INFO L225 Difference]: With dead ends: 44 [2018-11-28 13:22:12,771 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 13:22:12,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:22:12,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 13:22:12,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 13:22:12,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 13:22:12,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 13:22:12,772 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2018-11-28 13:22:12,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:12,772 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:22:12,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:22:12,772 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:22:12,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 13:22:12,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:22:12 BoogieIcfgContainer [2018-11-28 13:22:12,775 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:22:12,775 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:22:12,775 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:22:12,776 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:22:12,776 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:12:57" (3/4) ... [2018-11-28 13:22:12,779 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 13:22:12,785 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 13:22:12,785 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-11-28 13:22:12,785 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_destroy [2018-11-28 13:22:12,785 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_update_at [2018-11-28 13:22:12,785 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-28 13:22:12,786 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-28 13:22:12,786 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2018-11-28 13:22:12,786 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_get_data_at [2018-11-28 13:22:12,786 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 13:22:12,786 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-11-28 13:22:12,790 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-11-28 13:22:12,790 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-28 13:22:12,791 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 13:22:12,817 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_38d30611-b163-47ed-b2c9-86bbbb9c31f8/bin-2019/uautomizer/witness.graphml [2018-11-28 13:22:12,817 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:22:12,817 INFO L168 Benchmark]: Toolchain (without parser) took 555878.82 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 228.6 MB). Free memory was 956.0 MB in the beginning and 1.2 GB in the end (delta: -231.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:22:12,818 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:22:12,818 INFO L168 Benchmark]: CACSL2BoogieTranslator took 451.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.8 MB). Free memory was 956.0 MB in the beginning and 1.2 GB in the end (delta: -229.6 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:22:12,818 INFO L168 Benchmark]: Boogie Preprocessor took 54.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-28 13:22:12,818 INFO L168 Benchmark]: RCFGBuilder took 487.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. [2018-11-28 13:22:12,819 INFO L168 Benchmark]: TraceAbstraction took 554839.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 28.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -69.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:22:12,819 INFO L168 Benchmark]: Witness Printer took 41.52 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:22:12,820 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 451.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.8 MB). Free memory was 956.0 MB in the beginning and 1.2 GB in the end (delta: -229.6 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 487.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 554839.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 28.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -69.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 41.52 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 584]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 584]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 602]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: 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 - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 94 locations, 19 error locations. SAFE Result, 554.7s OverallTime, 32 OverallIterations, 3 TraceHistogramMax, 371.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1985 SDtfs, 3409 SDslu, 14605 SDs, 0 SdLazy, 30856 SolverSat, 1089 SolverUnsat, 188 SolverUnknown, 0 SolverNotchecked, 239.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2402 GetRequests, 1228 SyntacticMatches, 96 SemanticMatches, 1078 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 20312 ImplicationChecksByTransitivity, 299.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 348 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 181.2s InterpolantComputationTime, 3439 NumberOfCodeBlocks, 3439 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 3388 ConstructedInterpolants, 353 QuantifiedInterpolants, 4068852 SizeOfPredicates, 288 NumberOfNonLiveVariables, 6800 ConjunctsInSsa, 1092 ConjunctsInUnsatCore, 51 InterpolantComputations, 17 PerfectInterpolantSequences, 1041/1498 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...