./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_remove_all_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_remove_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/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 082b1bde50b1883aaa9112842176e8bb0db36577 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 13:57:02,313 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 13:57:02,315 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 13:57:02,322 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 13:57:02,323 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 13:57:02,323 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 13:57:02,324 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 13:57:02,325 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 13:57:02,326 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 13:57:02,326 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 13:57:02,327 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 13:57:02,327 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 13:57:02,328 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 13:57:02,328 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 13:57:02,329 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 13:57:02,330 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 13:57:02,330 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 13:57:02,331 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 13:57:02,333 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 13:57:02,334 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 13:57:02,334 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 13:57:02,335 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 13:57:02,337 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 13:57:02,337 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 13:57:02,337 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 13:57:02,338 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 13:57:02,339 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 13:57:02,339 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 13:57:02,340 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 13:57:02,340 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 13:57:02,341 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 13:57:02,341 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 13:57:02,341 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 13:57:02,341 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 13:57:02,342 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 13:57:02,342 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 13:57:02,343 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-01 13:57:02,353 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 13:57:02,353 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 13:57:02,354 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 13:57:02,354 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 13:57:02,354 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 13:57:02,354 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 13:57:02,355 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 13:57:02,355 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 13:57:02,355 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 13:57:02,355 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 13:57:02,355 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 13:57:02,355 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 13:57:02,355 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 13:57:02,355 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-01 13:57:02,355 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-01 13:57:02,355 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-01 13:57:02,356 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 13:57:02,356 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 13:57:02,356 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 13:57:02,356 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 13:57:02,356 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 13:57:02,356 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 13:57:02,356 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 13:57:02,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 13:57:02,357 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 13:57:02,357 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 13:57:02,357 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 13:57:02,357 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 13:57:02,357 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_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/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 -> 082b1bde50b1883aaa9112842176e8bb0db36577 [2018-12-01 13:57:02,380 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 13:57:02,389 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 13:57:02,391 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 13:57:02,392 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 13:57:02,392 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 13:57:02,393 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2c_remove_all_true-unreach-call_true-valid-memsafety.i [2018-12-01 13:57:02,433 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/data/3bbdac1f8/790a2b528c9a41fe93393d3242d3b5b0/FLAGb39e4db2c [2018-12-01 13:57:02,775 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 13:57:02,776 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/sv-benchmarks/c/list-simple/sll2c_remove_all_true-unreach-call_true-valid-memsafety.i [2018-12-01 13:57:02,785 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/data/3bbdac1f8/790a2b528c9a41fe93393d3242d3b5b0/FLAGb39e4db2c [2018-12-01 13:57:03,167 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/data/3bbdac1f8/790a2b528c9a41fe93393d3242d3b5b0 [2018-12-01 13:57:03,169 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 13:57:03,169 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-01 13:57:03,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 13:57:03,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 13:57:03,172 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 13:57:03,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 01:57:03" (1/1) ... [2018-12-01 13:57:03,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@955115c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:57:03, skipping insertion in model container [2018-12-01 13:57:03,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 01:57:03" (1/1) ... [2018-12-01 13:57:03,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 13:57:03,196 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 13:57:03,342 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 13:57:03,348 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 13:57:03,420 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 13:57:03,444 INFO L195 MainTranslator]: Completed translation [2018-12-01 13:57:03,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:57:03 WrapperNode [2018-12-01 13:57:03,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 13:57:03,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 13:57:03,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 13:57:03,445 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 13:57:03,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:57:03" (1/1) ... [2018-12-01 13:57:03,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:57:03" (1/1) ... [2018-12-01 13:57:03,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:57:03" (1/1) ... [2018-12-01 13:57:03,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:57:03" (1/1) ... [2018-12-01 13:57:03,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:57:03" (1/1) ... [2018-12-01 13:57:03,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:57:03" (1/1) ... [2018-12-01 13:57:03,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:57:03" (1/1) ... [2018-12-01 13:57:03,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 13:57:03,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 13:57:03,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 13:57:03,486 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 13:57:03,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:57:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 13:57:03,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 13:57:03,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 13:57:03,517 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-01 13:57:03,517 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-01 13:57:03,517 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-01 13:57:03,517 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-01 13:57:03,517 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-12-01 13:57:03,517 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_remove_first [2018-12-01 13:57:03,518 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 13:57:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-01 13:57:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-01 13:57:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-01 13:57:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-01 13:57:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-01 13:57:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-01 13:57:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-01 13:57:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-01 13:57:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-01 13:57:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-01 13:57:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-01 13:57:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-01 13:57:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-01 13:57:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-01 13:57:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-01 13:57:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-01 13:57:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-01 13:57:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-01 13:57:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-01 13:57:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-01 13:57:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-01 13:57:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-01 13:57:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-01 13:57:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-01 13:57:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-01 13:57:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-01 13:57:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-01 13:57:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-01 13:57:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-01 13:57:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-01 13:57:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-01 13:57:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-01 13:57:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-01 13:57:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-01 13:57:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-01 13:57:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-01 13:57:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-01 13:57:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-01 13:57:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-01 13:57:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-01 13:57:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-01 13:57:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-01 13:57:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-01 13:57:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-01 13:57:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-01 13:57:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-01 13:57:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-01 13:57:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-01 13:57:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-01 13:57:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-01 13:57:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-01 13:57:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-01 13:57:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-01 13:57:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-01 13:57:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-01 13:57:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-01 13:57:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-01 13:57:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-01 13:57:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-01 13:57:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-01 13:57:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-01 13:57:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-01 13:57:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-01 13:57:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-01 13:57:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-01 13:57:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-01 13:57:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-01 13:57:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-01 13:57:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-01 13:57:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-01 13:57:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-01 13:57:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-01 13:57:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-01 13:57:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-01 13:57:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-01 13:57:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-01 13:57:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-01 13:57:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-01 13:57:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-01 13:57:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-01 13:57:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-01 13:57:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-01 13:57:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-01 13:57:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-01 13:57:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-01 13:57:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-01 13:57:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-01 13:57:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-01 13:57:03,524 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-01 13:57:03,524 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-01 13:57:03,524 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-01 13:57:03,524 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-01 13:57:03,524 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-01 13:57:03,524 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-01 13:57:03,524 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-01 13:57:03,524 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-01 13:57:03,524 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-01 13:57:03,524 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-01 13:57:03,524 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-01 13:57:03,524 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-01 13:57:03,524 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-01 13:57:03,525 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-01 13:57:03,525 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-01 13:57:03,525 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-01 13:57:03,525 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-01 13:57:03,525 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-01 13:57:03,525 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-01 13:57:03,525 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-01 13:57:03,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 13:57:03,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-01 13:57:03,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 13:57:03,525 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-12-01 13:57:03,525 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_remove_first [2018-12-01 13:57:03,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-01 13:57:03,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 13:57:03,526 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 13:57:03,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-01 13:57:03,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 13:57:03,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 13:57:03,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 13:57:03,797 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 13:57:03,797 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-01 13:57:03,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:57:03 BoogieIcfgContainer [2018-12-01 13:57:03,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 13:57:03,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 13:57:03,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 13:57:03,800 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 13:57:03,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 01:57:03" (1/3) ... [2018-12-01 13:57:03,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62502599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 01:57:03, skipping insertion in model container [2018-12-01 13:57:03,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:57:03" (2/3) ... [2018-12-01 13:57:03,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62502599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 01:57:03, skipping insertion in model container [2018-12-01 13:57:03,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:57:03" (3/3) ... [2018-12-01 13:57:03,802 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all_true-unreach-call_true-valid-memsafety.i [2018-12-01 13:57:03,808 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 13:57:03,813 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-12-01 13:57:03,823 INFO L257 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2018-12-01 13:57:03,837 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 13:57:03,837 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 13:57:03,837 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-01 13:57:03,837 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 13:57:03,837 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 13:57:03,837 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 13:57:03,837 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 13:57:03,838 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 13:57:03,838 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 13:57:03,847 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2018-12-01 13:57:03,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-01 13:57:03,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:57:03,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:57:03,854 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:57:03,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:57:03,858 INFO L82 PathProgramCache]: Analyzing trace with hash 926435682, now seen corresponding path program 1 times [2018-12-01 13:57:03,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:57:03,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:57:03,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:57:03,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:57:03,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:57:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:57:03,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:57:03,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:57:03,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 13:57:03,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 13:57:03,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 13:57:03,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 13:57:03,969 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 3 states. [2018-12-01 13:57:04,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:57:04,040 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-12-01 13:57:04,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 13:57:04,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-01 13:57:04,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:57:04,047 INFO L225 Difference]: With dead ends: 101 [2018-12-01 13:57:04,047 INFO L226 Difference]: Without dead ends: 94 [2018-12-01 13:57:04,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 13:57:04,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-01 13:57:04,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-01 13:57:04,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-01 13:57:04,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2018-12-01 13:57:04,073 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 12 [2018-12-01 13:57:04,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:57:04,073 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-12-01 13:57:04,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 13:57:04,074 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2018-12-01 13:57:04,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-01 13:57:04,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:57:04,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:57:04,075 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:57:04,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:57:04,075 INFO L82 PathProgramCache]: Analyzing trace with hash 926435683, now seen corresponding path program 1 times [2018-12-01 13:57:04,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:57:04,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:57:04,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:57:04,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:57:04,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:57:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:57:04,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:57:04,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:57:04,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 13:57:04,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 13:57:04,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 13:57:04,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 13:57:04,118 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 3 states. [2018-12-01 13:57:04,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:57:04,166 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-12-01 13:57:04,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 13:57:04,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-01 13:57:04,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:57:04,167 INFO L225 Difference]: With dead ends: 92 [2018-12-01 13:57:04,167 INFO L226 Difference]: Without dead ends: 92 [2018-12-01 13:57:04,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 13:57:04,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-01 13:57:04,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-01 13:57:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-01 13:57:04,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-12-01 13:57:04,175 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 12 [2018-12-01 13:57:04,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:57:04,175 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-12-01 13:57:04,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 13:57:04,175 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-12-01 13:57:04,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-01 13:57:04,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:57:04,176 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-12-01 13:57:04,176 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:57:04,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:57:04,176 INFO L82 PathProgramCache]: Analyzing trace with hash 694828250, now seen corresponding path program 1 times [2018-12-01 13:57:04,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:57:04,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:57:04,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:57:04,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:57:04,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:57:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:57:04,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:57:04,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:57:04,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 13:57:04,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 13:57:04,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 13:57:04,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:57:04,228 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 6 states. [2018-12-01 13:57:04,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:57:04,345 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-12-01 13:57:04,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 13:57:04,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-01 13:57:04,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:57:04,347 INFO L225 Difference]: With dead ends: 96 [2018-12-01 13:57:04,347 INFO L226 Difference]: Without dead ends: 96 [2018-12-01 13:57:04,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:57:04,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-01 13:57:04,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-12-01 13:57:04,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-01 13:57:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2018-12-01 13:57:04,352 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 19 [2018-12-01 13:57:04,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:57:04,353 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2018-12-01 13:57:04,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 13:57:04,353 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2018-12-01 13:57:04,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-01 13:57:04,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:57:04,353 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-12-01 13:57:04,353 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:57:04,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:57:04,354 INFO L82 PathProgramCache]: Analyzing trace with hash 694828251, now seen corresponding path program 1 times [2018-12-01 13:57:04,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:57:04,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:57:04,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:57:04,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:57:04,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:57:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:57:04,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:57:04,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:57:04,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 13:57:04,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 13:57:04,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 13:57:04,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 13:57:04,380 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 5 states. [2018-12-01 13:57:04,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:57:04,398 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-12-01 13:57:04,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 13:57:04,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-01 13:57:04,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:57:04,399 INFO L225 Difference]: With dead ends: 93 [2018-12-01 13:57:04,399 INFO L226 Difference]: Without dead ends: 93 [2018-12-01 13:57:04,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:57:04,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-01 13:57:04,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-01 13:57:04,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-01 13:57:04,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-12-01 13:57:04,403 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 19 [2018-12-01 13:57:04,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:57:04,403 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-12-01 13:57:04,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 13:57:04,403 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-12-01 13:57:04,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 13:57:04,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:57:04,403 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:57:04,404 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:57:04,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:57:04,404 INFO L82 PathProgramCache]: Analyzing trace with hash 32148750, now seen corresponding path program 1 times [2018-12-01 13:57:04,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:57:04,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:57:04,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:57:04,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:57:04,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:57:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:57:04,440 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-01 13:57:04,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:57:04,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 13:57:04,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 13:57:04,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 13:57:04,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:57:04,441 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 6 states. [2018-12-01 13:57:04,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:57:04,557 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-12-01 13:57:04,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 13:57:04,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-01 13:57:04,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:57:04,557 INFO L225 Difference]: With dead ends: 93 [2018-12-01 13:57:04,558 INFO L226 Difference]: Without dead ends: 93 [2018-12-01 13:57:04,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:57:04,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-01 13:57:04,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-12-01 13:57:04,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-01 13:57:04,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-12-01 13:57:04,561 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 28 [2018-12-01 13:57:04,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:57:04,561 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-12-01 13:57:04,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 13:57:04,562 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-12-01 13:57:04,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 13:57:04,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:57:04,562 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:57:04,562 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:57:04,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:57:04,563 INFO L82 PathProgramCache]: Analyzing trace with hash 32148751, now seen corresponding path program 1 times [2018-12-01 13:57:04,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:57:04,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:57:04,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:57:04,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:57:04,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:57:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:57:04,639 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 13:57:04,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:57:04,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 13:57:04,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 13:57:04,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 13:57:04,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:57:04,641 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 6 states. [2018-12-01 13:57:04,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:57:04,744 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-12-01 13:57:04,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 13:57:04,745 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-01 13:57:04,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:57:04,745 INFO L225 Difference]: With dead ends: 92 [2018-12-01 13:57:04,745 INFO L226 Difference]: Without dead ends: 92 [2018-12-01 13:57:04,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:57:04,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-01 13:57:04,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-12-01 13:57:04,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-01 13:57:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-12-01 13:57:04,749 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 28 [2018-12-01 13:57:04,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:57:04,749 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-12-01 13:57:04,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 13:57:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-12-01 13:57:04,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-01 13:57:04,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:57:04,750 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-01 13:57:04,750 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:57:04,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:57:04,750 INFO L82 PathProgramCache]: Analyzing trace with hash -34254296, now seen corresponding path program 1 times [2018-12-01 13:57:04,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:57:04,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:57:04,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:57:04,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:57:04,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:57:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:57:04,882 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 13:57:04,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:57:04,882 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 13:57:04,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:57:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:57:04,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:57:06,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-01 13:57:06,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:57:06,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:57:06,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-01 13:57:06,118 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 13:57:06,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:57:06,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-12-01 13:57:06,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-01 13:57:06,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 13:57:06,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=96, Unknown=4, NotChecked=0, Total=132 [2018-12-01 13:57:06,134 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 12 states. [2018-12-01 13:57:06,445 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-01 13:57:06,714 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-01 13:57:06,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:57:06,847 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-12-01 13:57:06,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 13:57:06,848 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-12-01 13:57:06,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:57:06,849 INFO L225 Difference]: With dead ends: 91 [2018-12-01 13:57:06,849 INFO L226 Difference]: Without dead ends: 91 [2018-12-01 13:57:06,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=58, Invalid=178, Unknown=4, NotChecked=0, Total=240 [2018-12-01 13:57:06,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-01 13:57:06,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-12-01 13:57:06,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-01 13:57:06,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-12-01 13:57:06,852 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 31 [2018-12-01 13:57:06,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:57:06,852 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-12-01 13:57:06,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-01 13:57:06,852 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-12-01 13:57:06,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-01 13:57:06,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:57:06,853 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-01 13:57:06,853 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:57:06,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:57:06,853 INFO L82 PathProgramCache]: Analyzing trace with hash -34254295, now seen corresponding path program 1 times [2018-12-01 13:57:06,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:57:06,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:57:06,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:57:06,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:57:06,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:57:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:57:06,914 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 13:57:06,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:57:06,914 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 13:57:06,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:57:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:57:06,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:57:06,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 13:57:06,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:57:06,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:57:06,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-01 13:57:07,231 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.base Int)) (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base 8))) is different from true [2018-12-01 13:57:07,240 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 19 treesize of output 14 [2018-12-01 13:57:07,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:57:07,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:57:07,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:17 [2018-12-01 13:57:07,256 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2018-12-01 13:57:07,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:57:07,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-12-01 13:57:07,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-01 13:57:07,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-01 13:57:07,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2018-12-01 13:57:07,281 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 14 states. [2018-12-01 13:57:07,825 WARN L180 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2018-12-01 13:57:08,368 WARN L180 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2018-12-01 13:57:08,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:57:08,594 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-12-01 13:57:08,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 13:57:08,594 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-12-01 13:57:08,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:57:08,595 INFO L225 Difference]: With dead ends: 90 [2018-12-01 13:57:08,595 INFO L226 Difference]: Without dead ends: 90 [2018-12-01 13:57:08,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=57, Invalid=218, Unknown=1, NotChecked=30, Total=306 [2018-12-01 13:57:08,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-01 13:57:08,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-12-01 13:57:08,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-01 13:57:08,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-12-01 13:57:08,598 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 31 [2018-12-01 13:57:08,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:57:08,598 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-12-01 13:57:08,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-01 13:57:08,598 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-12-01 13:57:08,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-01 13:57:08,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:57:08,598 INFO L402 BasicCegarLoop]: trace histogram [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-12-01 13:57:08,599 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:57:08,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:57:08,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1270838546, now seen corresponding path program 1 times [2018-12-01 13:57:08,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:57:08,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:57:08,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:57:08,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:57:08,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:57:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:57:08,621 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 13:57:08,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:57:08,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 13:57:08,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 13:57:08,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 13:57:08,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 13:57:08,621 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 4 states. [2018-12-01 13:57:08,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:57:08,630 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-12-01 13:57:08,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 13:57:08,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-01 13:57:08,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:57:08,631 INFO L225 Difference]: With dead ends: 92 [2018-12-01 13:57:08,631 INFO L226 Difference]: Without dead ends: 92 [2018-12-01 13:57:08,631 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-12-01 13:57:08,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-01 13:57:08,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-12-01 13:57:08,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-01 13:57:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-12-01 13:57:08,633 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 37 [2018-12-01 13:57:08,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:57:08,633 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-12-01 13:57:08,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 13:57:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-12-01 13:57:08,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-01 13:57:08,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:57:08,634 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-01 13:57:08,634 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:57:08,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:57:08,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1505300450, now seen corresponding path program 1 times [2018-12-01 13:57:08,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:57:08,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:57:08,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:57:08,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:57:08,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:57:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:57:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 13:57:08,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:57:08,760 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 13:57:08,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:57:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:57:08,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:57:08,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 13:57:08,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:57:08,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:57:08,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-01 13:57:09,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:57:09,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:57:09,615 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 20 treesize of output 27 [2018-12-01 13:57:09,619 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 20 [2018-12-01 13:57:09,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:57:09,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:57:09,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 13:57:09,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:20 [2018-12-01 13:57:09,672 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 13:57:09,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:57:09,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-12-01 13:57:09,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-01 13:57:09,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-01 13:57:09,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=244, Unknown=3, NotChecked=0, Total=306 [2018-12-01 13:57:09,688 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 18 states. [2018-12-01 13:57:21,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:57:21,062 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2018-12-01 13:57:21,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 13:57:21,062 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-12-01 13:57:21,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:57:21,063 INFO L225 Difference]: With dead ends: 137 [2018-12-01 13:57:21,063 INFO L226 Difference]: Without dead ends: 137 [2018-12-01 13:57:21,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=127, Invalid=422, Unknown=3, NotChecked=0, Total=552 [2018-12-01 13:57:21,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-01 13:57:21,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 99. [2018-12-01 13:57:21,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-01 13:57:21,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-12-01 13:57:21,068 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 39 [2018-12-01 13:57:21,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:57:21,068 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-12-01 13:57:21,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-01 13:57:21,068 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-12-01 13:57:21,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-01 13:57:21,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:57:21,069 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-01 13:57:21,069 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:57:21,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:57:21,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1505300451, now seen corresponding path program 1 times [2018-12-01 13:57:21,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:57:21,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:57:21,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:57:21,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:57:21,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:57:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:57:21,204 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:57:21,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:57:21,205 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 13:57:21,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:57:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:57:21,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:57:21,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 13:57:21,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:57:21,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 13:57:21,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:57:21,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:57:21,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-01 13:57:26,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:57:26,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:57:26,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 13:57:26,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:57:26,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:57:26,348 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-01 13:57:26,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2018-12-01 13:57:26,355 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-01 13:57:26,365 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 13:57:26,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-01 13:57:26,379 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:33, output treesize:42 [2018-12-01 13:57:26,454 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:57:26,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:57:26,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2018-12-01 13:57:26,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-01 13:57:26,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-01 13:57:26,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=245, Unknown=4, NotChecked=0, Total=306 [2018-12-01 13:57:26,470 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 18 states. [2018-12-01 13:57:47,791 WARN L180 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2018-12-01 13:57:51,867 WARN L180 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2018-12-01 13:57:55,567 WARN L180 SmtUtils]: Spent 3.61 s on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2018-12-01 13:59:13,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:59:13,271 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2018-12-01 13:59:13,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 13:59:13,271 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-12-01 13:59:13,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:59:13,272 INFO L225 Difference]: With dead ends: 146 [2018-12-01 13:59:13,272 INFO L226 Difference]: Without dead ends: 146 [2018-12-01 13:59:13,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=117, Invalid=430, Unknown=5, NotChecked=0, Total=552 [2018-12-01 13:59:13,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-01 13:59:13,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 127. [2018-12-01 13:59:13,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-01 13:59:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 153 transitions. [2018-12-01 13:59:13,275 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 153 transitions. Word has length 39 [2018-12-01 13:59:13,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:59:13,275 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 153 transitions. [2018-12-01 13:59:13,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-01 13:59:13,275 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 153 transitions. [2018-12-01 13:59:13,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 13:59:13,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:59:13,276 INFO L402 BasicCegarLoop]: trace histogram [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-12-01 13:59:13,276 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:59:13,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:59:13,276 INFO L82 PathProgramCache]: Analyzing trace with hash -580326251, now seen corresponding path program 1 times [2018-12-01 13:59:13,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:59:13,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:59:13,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:13,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:13,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-01 13:59:13,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:59:13,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-01 13:59:13,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-01 13:59:13,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-01 13:59:13,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-01 13:59:13,357 INFO L87 Difference]: Start difference. First operand 127 states and 153 transitions. Second operand 13 states. [2018-12-01 13:59:13,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:59:13,615 INFO L93 Difference]: Finished difference Result 175 states and 215 transitions. [2018-12-01 13:59:13,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 13:59:13,615 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-12-01 13:59:13,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:59:13,616 INFO L225 Difference]: With dead ends: 175 [2018-12-01 13:59:13,616 INFO L226 Difference]: Without dead ends: 175 [2018-12-01 13:59:13,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-12-01 13:59:13,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-01 13:59:13,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 132. [2018-12-01 13:59:13,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-01 13:59:13,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 163 transitions. [2018-12-01 13:59:13,620 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 163 transitions. Word has length 40 [2018-12-01 13:59:13,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:59:13,620 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 163 transitions. [2018-12-01 13:59:13,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-01 13:59:13,620 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 163 transitions. [2018-12-01 13:59:13,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 13:59:13,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:59:13,621 INFO L402 BasicCegarLoop]: trace histogram [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-12-01 13:59:13,621 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:59:13,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:59:13,622 INFO L82 PathProgramCache]: Analyzing trace with hash -580326250, now seen corresponding path program 1 times [2018-12-01 13:59:13,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:59:13,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:59:13,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:13,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:13,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:13,753 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 13:59:13,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:59:13,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-01 13:59:13,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-01 13:59:13,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-01 13:59:13,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-01 13:59:13,754 INFO L87 Difference]: Start difference. First operand 132 states and 163 transitions. Second operand 13 states. [2018-12-01 13:59:14,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:59:14,033 INFO L93 Difference]: Finished difference Result 178 states and 218 transitions. [2018-12-01 13:59:14,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 13:59:14,033 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-12-01 13:59:14,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:59:14,034 INFO L225 Difference]: With dead ends: 178 [2018-12-01 13:59:14,034 INFO L226 Difference]: Without dead ends: 178 [2018-12-01 13:59:14,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-12-01 13:59:14,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-01 13:59:14,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 132. [2018-12-01 13:59:14,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-01 13:59:14,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 161 transitions. [2018-12-01 13:59:14,037 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 161 transitions. Word has length 40 [2018-12-01 13:59:14,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:59:14,038 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 161 transitions. [2018-12-01 13:59:14,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-01 13:59:14,038 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 161 transitions. [2018-12-01 13:59:14,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-01 13:59:14,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:59:14,038 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-01 13:59:14,038 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:59:14,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:59:14,039 INFO L82 PathProgramCache]: Analyzing trace with hash -52836852, now seen corresponding path program 1 times [2018-12-01 13:59:14,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:59:14,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:59:14,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:14,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:14,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:14,100 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 13:59:14,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:59:14,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-01 13:59:14,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-01 13:59:14,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-01 13:59:14,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-01 13:59:14,101 INFO L87 Difference]: Start difference. First operand 132 states and 161 transitions. Second operand 13 states. [2018-12-01 13:59:14,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:59:14,328 INFO L93 Difference]: Finished difference Result 204 states and 255 transitions. [2018-12-01 13:59:14,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-01 13:59:14,328 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-12-01 13:59:14,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:59:14,329 INFO L225 Difference]: With dead ends: 204 [2018-12-01 13:59:14,329 INFO L226 Difference]: Without dead ends: 204 [2018-12-01 13:59:14,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2018-12-01 13:59:14,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-12-01 13:59:14,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 166. [2018-12-01 13:59:14,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-01 13:59:14,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 217 transitions. [2018-12-01 13:59:14,333 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 217 transitions. Word has length 45 [2018-12-01 13:59:14,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:59:14,333 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 217 transitions. [2018-12-01 13:59:14,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-01 13:59:14,333 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 217 transitions. [2018-12-01 13:59:14,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-01 13:59:14,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:59:14,333 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:59:14,333 INFO L423 AbstractCegarLoop]: === Iteration 15 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:59:14,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:59:14,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1637572900, now seen corresponding path program 1 times [2018-12-01 13:59:14,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:59:14,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:59:14,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:14,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:14,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:14,358 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 13:59:14,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:59:14,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 13:59:14,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 13:59:14,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 13:59:14,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:59:14,359 INFO L87 Difference]: Start difference. First operand 166 states and 217 transitions. Second operand 6 states. [2018-12-01 13:59:14,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:59:14,462 INFO L93 Difference]: Finished difference Result 167 states and 217 transitions. [2018-12-01 13:59:14,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 13:59:14,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-12-01 13:59:14,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:59:14,464 INFO L225 Difference]: With dead ends: 167 [2018-12-01 13:59:14,464 INFO L226 Difference]: Without dead ends: 167 [2018-12-01 13:59:14,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-01 13:59:14,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-01 13:59:14,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2018-12-01 13:59:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-01 13:59:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 217 transitions. [2018-12-01 13:59:14,469 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 217 transitions. Word has length 46 [2018-12-01 13:59:14,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:59:14,469 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 217 transitions. [2018-12-01 13:59:14,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 13:59:14,469 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 217 transitions. [2018-12-01 13:59:14,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-01 13:59:14,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:59:14,469 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:59:14,469 INFO L423 AbstractCegarLoop]: === Iteration 16 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:59:14,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:59:14,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1637572899, now seen corresponding path program 1 times [2018-12-01 13:59:14,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:59:14,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:59:14,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:14,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:14,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 13:59:14,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:59:14,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-01 13:59:14,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-01 13:59:14,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-01 13:59:14,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-12-01 13:59:14,628 INFO L87 Difference]: Start difference. First operand 166 states and 217 transitions. Second operand 15 states. [2018-12-01 13:59:14,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:59:14,996 INFO L93 Difference]: Finished difference Result 239 states and 303 transitions. [2018-12-01 13:59:14,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-01 13:59:14,996 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-12-01 13:59:14,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:59:14,997 INFO L225 Difference]: With dead ends: 239 [2018-12-01 13:59:14,997 INFO L226 Difference]: Without dead ends: 239 [2018-12-01 13:59:14,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2018-12-01 13:59:14,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-12-01 13:59:15,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 198. [2018-12-01 13:59:15,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-12-01 13:59:15,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 264 transitions. [2018-12-01 13:59:15,004 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 264 transitions. Word has length 46 [2018-12-01 13:59:15,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:59:15,004 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 264 transitions. [2018-12-01 13:59:15,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-01 13:59:15,004 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 264 transitions. [2018-12-01 13:59:15,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-01 13:59:15,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:59:15,004 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:59:15,004 INFO L423 AbstractCegarLoop]: === Iteration 17 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:59:15,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:59:15,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1637942281, now seen corresponding path program 1 times [2018-12-01 13:59:15,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:59:15,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:59:15,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:15,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:15,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:15,026 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 13:59:15,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:59:15,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 13:59:15,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 13:59:15,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 13:59:15,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 13:59:15,026 INFO L87 Difference]: Start difference. First operand 198 states and 264 transitions. Second operand 5 states. [2018-12-01 13:59:15,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:59:15,085 INFO L93 Difference]: Finished difference Result 197 states and 260 transitions. [2018-12-01 13:59:15,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 13:59:15,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-01 13:59:15,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:59:15,086 INFO L225 Difference]: With dead ends: 197 [2018-12-01 13:59:15,086 INFO L226 Difference]: Without dead ends: 197 [2018-12-01 13:59:15,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:59:15,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-01 13:59:15,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-12-01 13:59:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-01 13:59:15,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 260 transitions. [2018-12-01 13:59:15,090 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 260 transitions. Word has length 46 [2018-12-01 13:59:15,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:59:15,090 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 260 transitions. [2018-12-01 13:59:15,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 13:59:15,090 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 260 transitions. [2018-12-01 13:59:15,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-01 13:59:15,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:59:15,091 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:59:15,091 INFO L423 AbstractCegarLoop]: === Iteration 18 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:59:15,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:59:15,091 INFO L82 PathProgramCache]: Analyzing trace with hash 763396975, now seen corresponding path program 1 times [2018-12-01 13:59:15,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:59:15,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:59:15,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:15,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:15,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:15,261 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 13:59:15,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:59:15,261 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 13:59:15,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:15,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:59:15,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 13:59:15,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:15,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:15,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 13:59:15,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:15,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:15,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:15,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-01 13:59:15,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:15,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:15,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:8 [2018-12-01 13:59:15,809 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 16 treesize of output 12 [2018-12-01 13:59:15,811 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 12 treesize of output 4 [2018-12-01 13:59:15,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:15,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:15,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:15,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-12-01 13:59:15,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:15,817 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-12-01 13:59:15,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:15,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:59:15,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-01 13:59:15,845 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 13:59:15,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:59:15,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 32 [2018-12-01 13:59:15,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-01 13:59:15,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-01 13:59:15,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2018-12-01 13:59:15,861 INFO L87 Difference]: Start difference. First operand 197 states and 260 transitions. Second operand 33 states. [2018-12-01 13:59:19,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:59:19,771 INFO L93 Difference]: Finished difference Result 217 states and 281 transitions. [2018-12-01 13:59:19,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-01 13:59:19,771 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-12-01 13:59:19,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:59:19,772 INFO L225 Difference]: With dead ends: 217 [2018-12-01 13:59:19,772 INFO L226 Difference]: Without dead ends: 217 [2018-12-01 13:59:19,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=1615, Unknown=0, NotChecked=0, Total=1806 [2018-12-01 13:59:19,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-12-01 13:59:19,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 203. [2018-12-01 13:59:19,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-01 13:59:19,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 265 transitions. [2018-12-01 13:59:19,776 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 265 transitions. Word has length 47 [2018-12-01 13:59:19,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:59:19,776 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 265 transitions. [2018-12-01 13:59:19,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-01 13:59:19,776 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 265 transitions. [2018-12-01 13:59:19,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-01 13:59:19,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:59:19,777 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:59:19,777 INFO L423 AbstractCegarLoop]: === Iteration 19 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:59:19,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:59:19,777 INFO L82 PathProgramCache]: Analyzing trace with hash -578653648, now seen corresponding path program 2 times [2018-12-01 13:59:19,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:59:19,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:59:19,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:19,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:19,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:19,800 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-01 13:59:19,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:59:19,800 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 13:59:19,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 13:59:19,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 13:59:19,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 13:59:19,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:59:19,845 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-01 13:59:19,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:59:19,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-01 13:59:19,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 13:59:19,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 13:59:19,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:59:19,872 INFO L87 Difference]: Start difference. First operand 203 states and 265 transitions. Second operand 6 states. [2018-12-01 13:59:19,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:59:19,896 INFO L93 Difference]: Finished difference Result 126 states and 145 transitions. [2018-12-01 13:59:19,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 13:59:19,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-12-01 13:59:19,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:59:19,897 INFO L225 Difference]: With dead ends: 126 [2018-12-01 13:59:19,897 INFO L226 Difference]: Without dead ends: 117 [2018-12-01 13:59:19,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:59:19,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-01 13:59:19,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-01 13:59:19,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-01 13:59:19,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 134 transitions. [2018-12-01 13:59:19,900 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 134 transitions. Word has length 51 [2018-12-01 13:59:19,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:59:19,900 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 134 transitions. [2018-12-01 13:59:19,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 13:59:19,900 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions. [2018-12-01 13:59:19,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-01 13:59:19,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:59:19,901 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:59:19,901 INFO L423 AbstractCegarLoop]: === Iteration 20 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:59:19,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:59:19,901 INFO L82 PathProgramCache]: Analyzing trace with hash -633588376, now seen corresponding path program 1 times [2018-12-01 13:59:19,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:59:19,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:59:19,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:19,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 13:59:19,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:19,999 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 13:59:20,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:59:20,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-01 13:59:20,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-01 13:59:20,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-01 13:59:20,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-01 13:59:20,000 INFO L87 Difference]: Start difference. First operand 117 states and 134 transitions. Second operand 11 states. [2018-12-01 13:59:20,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:59:20,242 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2018-12-01 13:59:20,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 13:59:20,243 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-12-01 13:59:20,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:59:20,243 INFO L225 Difference]: With dead ends: 116 [2018-12-01 13:59:20,243 INFO L226 Difference]: Without dead ends: 116 [2018-12-01 13:59:20,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-12-01 13:59:20,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-01 13:59:20,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-12-01 13:59:20,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-01 13:59:20,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2018-12-01 13:59:20,246 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 51 [2018-12-01 13:59:20,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:59:20,246 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2018-12-01 13:59:20,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-01 13:59:20,246 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2018-12-01 13:59:20,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-01 13:59:20,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:59:20,246 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:59:20,247 INFO L423 AbstractCegarLoop]: === Iteration 21 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:59:20,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:59:20,247 INFO L82 PathProgramCache]: Analyzing trace with hash -633535761, now seen corresponding path program 1 times [2018-12-01 13:59:20,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:59:20,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:59:20,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:20,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:20,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:20,493 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:59:20,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:59:20,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 13:59:20,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:20,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:59:20,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:20,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:20,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 13:59:20,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:20,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:20,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-01 13:59:20,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 13:59:20,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 13:59:20,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:20,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:20,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:20,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-12-01 13:59:20,601 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 37 treesize of output 33 [2018-12-01 13:59:20,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-01 13:59:20,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:20,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:20,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:59:20,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-12-01 13:59:20,817 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 68 treesize of output 60 [2018-12-01 13:59:20,819 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 60 treesize of output 49 [2018-12-01 13:59:20,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:20,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:20,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 13:59:20,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:56 [2018-12-01 13:59:20,936 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 49 [2018-12-01 13:59:20,940 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 38 treesize of output 29 [2018-12-01 13:59:20,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:20,963 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 29 treesize of output 22 [2018-12-01 13:59:20,963 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:20,983 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 32 treesize of output 25 [2018-12-01 13:59:20,983 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:21,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-12-01 13:59:21,004 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:21,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-12-01 13:59:21,024 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:21,042 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 34 treesize of output 25 [2018-12-01 13:59:21,042 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:21,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 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-12-01 13:59:21,060 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:21,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-12-01 13:59:21,073 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:21,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:21,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:21,077 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:60, output treesize:5 [2018-12-01 13:59:21,096 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:59:21,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:59:21,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 33 [2018-12-01 13:59:21,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-01 13:59:21,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-01 13:59:21,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2018-12-01 13:59:21,112 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand 34 states. [2018-12-01 13:59:22,129 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2018-12-01 13:59:24,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:59:24,363 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2018-12-01 13:59:24,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-01 13:59:24,365 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2018-12-01 13:59:24,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:59:24,366 INFO L225 Difference]: With dead ends: 125 [2018-12-01 13:59:24,367 INFO L226 Difference]: Without dead ends: 125 [2018-12-01 13:59:24,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=212, Invalid=2238, Unknown=0, NotChecked=0, Total=2450 [2018-12-01 13:59:24,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-01 13:59:24,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 114. [2018-12-01 13:59:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-01 13:59:24,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2018-12-01 13:59:24,375 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 51 [2018-12-01 13:59:24,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:59:24,376 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2018-12-01 13:59:24,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-01 13:59:24,377 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2018-12-01 13:59:24,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-01 13:59:24,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:59:24,378 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:59:24,379 INFO L423 AbstractCegarLoop]: === Iteration 22 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:59:24,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:59:24,380 INFO L82 PathProgramCache]: Analyzing trace with hash -633535760, now seen corresponding path program 1 times [2018-12-01 13:59:24,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:59:24,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:59:24,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:24,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:24,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:24,797 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:59:24,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:59:24,797 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 13:59:24,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:24,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:59:25,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:25,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:25,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 13:59:25,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:25,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-01 13:59:25,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:25,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:25,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:32 [2018-12-01 13:59:25,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 13:59:25,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 13:59:25,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:25,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:25,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 13:59:25,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 13:59:25,197 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:25,198 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:25,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:25,207 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:48 [2018-12-01 13:59:25,298 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 62 treesize of output 58 [2018-12-01 13:59:25,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-01 13:59:25,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:25,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:25,319 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 49 treesize of output 50 [2018-12-01 13:59:25,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-01 13:59:25,321 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:25,327 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:25,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:59:25,336 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:71 [2018-12-01 13:59:26,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:26,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:26,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 138 [2018-12-01 13:59:26,539 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 129 treesize of output 122 [2018-12-01 13:59:26,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:26,568 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 121 treesize of output 94 [2018-12-01 13:59:26,568 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:26,591 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 118 treesize of output 91 [2018-12-01 13:59:26,592 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:26,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 76 [2018-12-01 13:59:26,616 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:59:26,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 77 [2018-12-01 13:59:26,638 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:59:26,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 13:59:26,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 67 [2018-12-01 13:59:26,696 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 33 treesize of output 14 [2018-12-01 13:59:26,696 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:26,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-01 13:59:26,706 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:26,716 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-12-01 13:59:26,716 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:26,727 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:26,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 71 [2018-12-01 13:59:26,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 60 [2018-12-01 13:59:26,737 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:26,761 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 60 treesize of output 48 [2018-12-01 13:59:26,762 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:59:26,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-12-01 13:59:26,786 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:26,809 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 0 case distinctions, treesize of input 63 treesize of output 47 [2018-12-01 13:59:26,810 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:59:26,831 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 44 treesize of output 33 [2018-12-01 13:59:26,831 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:26,852 INFO L267 ElimStorePlain]: Start of recursive call 12: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 13:59:26,870 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 2 xjuncts. [2018-12-01 13:59:26,870 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 4 variables, input treesize:181, output treesize:47 [2018-12-01 13:59:26,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:59:27,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:59:27,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 29] total 51 [2018-12-01 13:59:27,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-01 13:59:27,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-01 13:59:27,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=2523, Unknown=0, NotChecked=0, Total=2652 [2018-12-01 13:59:27,008 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand 52 states. [2018-12-01 13:59:27,604 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2018-12-01 13:59:27,922 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2018-12-01 13:59:30,118 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2018-12-01 13:59:30,882 WARN L180 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 81 [2018-12-01 13:59:31,396 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 86 [2018-12-01 13:59:31,632 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2018-12-01 13:59:32,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:59:32,220 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2018-12-01 13:59:32,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-01 13:59:32,220 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-12-01 13:59:32,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:59:32,221 INFO L225 Difference]: With dead ends: 138 [2018-12-01 13:59:32,221 INFO L226 Difference]: Without dead ends: 138 [2018-12-01 13:59:32,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=333, Invalid=5069, Unknown=0, NotChecked=0, Total=5402 [2018-12-01 13:59:32,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-01 13:59:32,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 124. [2018-12-01 13:59:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-01 13:59:32,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 141 transitions. [2018-12-01 13:59:32,224 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 141 transitions. Word has length 51 [2018-12-01 13:59:32,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:59:32,224 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 141 transitions. [2018-12-01 13:59:32,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-01 13:59:32,224 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 141 transitions. [2018-12-01 13:59:32,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-01 13:59:32,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:59:32,224 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:59:32,225 INFO L423 AbstractCegarLoop]: === Iteration 23 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:59:32,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:59:32,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1855099592, now seen corresponding path program 1 times [2018-12-01 13:59:32,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:59:32,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:59:32,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:32,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:32,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:32,242 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 13:59:32,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:59:32,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 13:59:32,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 13:59:32,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 13:59:32,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 13:59:32,243 INFO L87 Difference]: Start difference. First operand 124 states and 141 transitions. Second operand 5 states. [2018-12-01 13:59:32,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:59:32,290 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2018-12-01 13:59:32,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 13:59:32,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-01 13:59:32,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:59:32,290 INFO L225 Difference]: With dead ends: 122 [2018-12-01 13:59:32,291 INFO L226 Difference]: Without dead ends: 122 [2018-12-01 13:59:32,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:59:32,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-01 13:59:32,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-12-01 13:59:32,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-01 13:59:32,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-12-01 13:59:32,293 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 52 [2018-12-01 13:59:32,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:59:32,293 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-12-01 13:59:32,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 13:59:32,294 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-12-01 13:59:32,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-01 13:59:32,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:59:32,294 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:59:32,294 INFO L423 AbstractCegarLoop]: === Iteration 24 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:59:32,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:59:32,295 INFO L82 PathProgramCache]: Analyzing trace with hash -339279462, now seen corresponding path program 1 times [2018-12-01 13:59:32,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:59:32,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:59:32,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:32,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:32,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:32,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 13:59:32,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:59:32,321 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 13:59:32,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:32,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:59:32,377 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 13:59:32,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:59:32,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-01 13:59:32,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 13:59:32,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 13:59:32,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:59:32,394 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 7 states. [2018-12-01 13:59:32,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:59:32,419 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2018-12-01 13:59:32,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 13:59:32,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-12-01 13:59:32,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:59:32,420 INFO L225 Difference]: With dead ends: 130 [2018-12-01 13:59:32,420 INFO L226 Difference]: Without dead ends: 130 [2018-12-01 13:59:32,420 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-12-01 13:59:32,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-01 13:59:32,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2018-12-01 13:59:32,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-01 13:59:32,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2018-12-01 13:59:32,423 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 54 [2018-12-01 13:59:32,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:59:32,423 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2018-12-01 13:59:32,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 13:59:32,423 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2018-12-01 13:59:32,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-01 13:59:32,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:59:32,424 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:59:32,424 INFO L423 AbstractCegarLoop]: === Iteration 25 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:59:32,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:59:32,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1922483537, now seen corresponding path program 1 times [2018-12-01 13:59:32,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:59:32,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:59:32,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:32,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:32,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:32,967 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:59:32,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:59:32,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 13:59:32,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:33,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:59:33,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:33,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:33,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 13:59:33,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:33,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:33,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-12-01 13:59:33,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 13:59:33,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 13:59:33,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:33,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:33,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:33,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-12-01 13:59:33,246 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 28 treesize of output 24 [2018-12-01 13:59:33,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-01 13:59:33,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:33,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:33,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:59:33,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-12-01 13:59:33,577 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 27 treesize of output 23 [2018-12-01 13:59:33,578 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 23 treesize of output 15 [2018-12-01 13:59:33,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:33,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:33,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:33,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:15 [2018-12-01 13:59:33,633 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:59:33,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:59:33,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 28] total 58 [2018-12-01 13:59:33,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-01 13:59:33,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-01 13:59:33,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=3104, Unknown=0, NotChecked=0, Total=3306 [2018-12-01 13:59:33,650 INFO L87 Difference]: Start difference. First operand 126 states and 142 transitions. Second operand 58 states. [2018-12-01 13:59:35,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:59:35,723 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2018-12-01 13:59:35,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-01 13:59:35,723 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 55 [2018-12-01 13:59:35,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:59:35,723 INFO L225 Difference]: With dead ends: 109 [2018-12-01 13:59:35,723 INFO L226 Difference]: Without dead ends: 103 [2018-12-01 13:59:35,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1792 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=563, Invalid=7093, Unknown=0, NotChecked=0, Total=7656 [2018-12-01 13:59:35,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-01 13:59:35,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-01 13:59:35,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-01 13:59:35,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2018-12-01 13:59:35,726 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 55 [2018-12-01 13:59:35,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:59:35,726 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2018-12-01 13:59:35,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-01 13:59:35,726 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2018-12-01 13:59:35,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-01 13:59:35,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:59:35,727 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:59:35,727 INFO L423 AbstractCegarLoop]: === Iteration 26 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:59:35,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:59:35,727 INFO L82 PathProgramCache]: Analyzing trace with hash 175007029, now seen corresponding path program 1 times [2018-12-01 13:59:35,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:59:35,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:59:35,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:35,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:35,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:35,961 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 13:59:35,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:59:35,961 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 13:59:35,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:35,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:59:36,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 13:59:36,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:36,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:36,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 13:59:36,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:36,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:36,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 13:59:36,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:36,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:36,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-12-01 13:59:36,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 13:59:36,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 13:59:36,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:36,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:36,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:36,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-01 13:59:36,296 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 37 treesize of output 33 [2018-12-01 13:59:36,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-01 13:59:36,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:36,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:36,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:59:36,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-12-01 13:59:36,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:36,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:36,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-01 13:59:36,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:36,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:59:36,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:37 [2018-12-01 13:59:36,656 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:59:36,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:36,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:36,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70 [2018-12-01 13:59:36,663 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:59:36,668 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 40 [2018-12-01 13:59:36,669 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 13:59:36,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-01 13:59:36,679 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:36,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-01 13:59:36,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:36,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:36,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:36,688 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:92, output treesize:22 [2018-12-01 13:59:36,752 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 26 treesize of output 27 [2018-12-01 13:59:36,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 13:59:36,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:36,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:36,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:36,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:18 [2018-12-01 13:59:36,771 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 15 treesize of output 11 [2018-12-01 13:59:36,772 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 11 treesize of output 3 [2018-12-01 13:59:36,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:36,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:36,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:36,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-01 13:59:36,781 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 13:59:36,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:59:36,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 45 [2018-12-01 13:59:36,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-01 13:59:36,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-01 13:59:36,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1932, Unknown=0, NotChecked=0, Total=2070 [2018-12-01 13:59:36,797 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand 46 states. [2018-12-01 13:59:37,702 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-12-01 13:59:38,334 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-12-01 13:59:38,761 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-12-01 13:59:39,361 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2018-12-01 13:59:39,786 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2018-12-01 13:59:40,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:59:40,805 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2018-12-01 13:59:40,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-01 13:59:40,806 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 56 [2018-12-01 13:59:40,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:59:40,808 INFO L225 Difference]: With dead ends: 116 [2018-12-01 13:59:40,808 INFO L226 Difference]: Without dead ends: 116 [2018-12-01 13:59:40,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=339, Invalid=3821, Unknown=0, NotChecked=0, Total=4160 [2018-12-01 13:59:40,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-01 13:59:40,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2018-12-01 13:59:40,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-01 13:59:40,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-12-01 13:59:40,817 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 56 [2018-12-01 13:59:40,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:59:40,818 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-12-01 13:59:40,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-01 13:59:40,818 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-12-01 13:59:40,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-01 13:59:40,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:59:40,819 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:59:40,820 INFO L423 AbstractCegarLoop]: === Iteration 27 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:59:40,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:59:40,820 INFO L82 PathProgramCache]: Analyzing trace with hash 175059644, now seen corresponding path program 2 times [2018-12-01 13:59:40,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:59:40,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:59:40,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:40,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:40,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:41,182 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:59:41,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:59:41,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 13:59:41,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 13:59:41,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 13:59:41,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 13:59:41,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:59:41,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:41,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:41,444 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 17 treesize of output 21 [2018-12-01 13:59:41,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:41,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:41,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:33 [2018-12-01 13:59:41,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 13:59:41,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 13:59:41,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:41,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:41,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 13:59:41,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 13:59:41,547 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:41,549 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:41,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:41,559 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-12-01 13:59:41,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:41,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 73 [2018-12-01 13:59:41,688 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 30 treesize of output 28 [2018-12-01 13:59:41,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:41,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:41,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2018-12-01 13:59:41,724 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 15 [2018-12-01 13:59:41,725 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:41,736 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:41,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:41,753 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:89, output treesize:73 [2018-12-01 13:59:43,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:43,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 130 [2018-12-01 13:59:43,110 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:59:43,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 96 [2018-12-01 13:59:43,112 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:59:43,138 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 78 treesize of output 69 [2018-12-01 13:59:43,139 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:43,161 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 118 treesize of output 107 [2018-12-01 13:59:43,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:43,181 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 107 treesize of output 87 [2018-12-01 13:59:43,182 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:59:43,202 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 87 treesize of output 76 [2018-12-01 13:59:43,202 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:43,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 13:59:43,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-01 13:59:43,239 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:191, output treesize:164 [2018-12-01 13:59:43,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:43,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:43,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:43,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 67 [2018-12-01 13:59:43,406 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 77 [2018-12-01 13:59:43,409 INFO L267 ElimStorePlain]: Start of recursive call 3: 17 dim-0 vars, End of recursive call: 17 dim-0 vars, and 7 xjuncts. [2018-12-01 13:59:43,495 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 53 treesize of output 52 [2018-12-01 13:59:43,496 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-01 13:59:43,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:43,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 52 [2018-12-01 13:59:43,499 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:43,504 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 57 treesize of output 56 [2018-12-01 13:59:43,504 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-01 13:59:43,509 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 47 treesize of output 46 [2018-12-01 13:59:43,509 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-01 13:59:43,511 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 47 treesize of output 40 [2018-12-01 13:59:43,511 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:43,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2018-12-01 13:59:43,519 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-01 13:59:43,520 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 41 treesize of output 34 [2018-12-01 13:59:43,520 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:43,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 39 [2018-12-01 13:59:43,612 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-01 13:59:43,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2018-12-01 13:59:43,617 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-12-01 13:59:43,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 34 treesize of output 23 [2018-12-01 13:59:43,618 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:43,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:43,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-12-01 13:59:43,621 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:43,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, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 39 [2018-12-01 13:59:43,627 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-12-01 13:59:43,628 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 32 treesize of output 23 [2018-12-01 13:59:43,629 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:43,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 35 [2018-12-01 13:59:43,633 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-12-01 13:59:43,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 34 treesize of output 23 [2018-12-01 13:59:43,698 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:43,742 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 23 treesize of output 19 [2018-12-01 13:59:43,743 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:59:43,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-12-01 13:59:43,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-12-01 13:59:43,827 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 3 variables, input treesize:79, output treesize:121 [2018-12-01 13:59:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:59:43,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:59:43,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30] total 54 [2018-12-01 13:59:43,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-01 13:59:43,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-01 13:59:43,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2792, Unknown=0, NotChecked=0, Total=2970 [2018-12-01 13:59:43,983 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 55 states. [2018-12-01 13:59:46,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:59:46,278 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2018-12-01 13:59:46,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-01 13:59:46,279 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 56 [2018-12-01 13:59:46,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:59:46,279 INFO L225 Difference]: With dead ends: 121 [2018-12-01 13:59:46,279 INFO L226 Difference]: Without dead ends: 121 [2018-12-01 13:59:46,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=379, Invalid=4733, Unknown=0, NotChecked=0, Total=5112 [2018-12-01 13:59:46,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-01 13:59:46,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 105. [2018-12-01 13:59:46,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-01 13:59:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2018-12-01 13:59:46,282 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 56 [2018-12-01 13:59:46,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:59:46,282 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2018-12-01 13:59:46,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-01 13:59:46,283 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2018-12-01 13:59:46,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-01 13:59:46,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:59:46,283 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:59:46,283 INFO L423 AbstractCegarLoop]: === Iteration 28 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:59:46,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:59:46,283 INFO L82 PathProgramCache]: Analyzing trace with hash 175059645, now seen corresponding path program 2 times [2018-12-01 13:59:46,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:59:46,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:59:46,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:46,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 13:59:46,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:46,703 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:59:46,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:59:46,703 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 13:59:46,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 13:59:46,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 13:59:46,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 13:59:46,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:59:46,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:46,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:46,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 13:59:46,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:46,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:46,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-12-01 13:59:47,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 13:59:47,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 13:59:47,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:47,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:47,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 13:59:47,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 13:59:47,029 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:47,031 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:47,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:47,037 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-12-01 13:59:47,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:47,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 64 [2018-12-01 13:59:47,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 30 treesize of output 28 [2018-12-01 13:59:47,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:47,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:47,132 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 53 treesize of output 54 [2018-12-01 13:59:47,133 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 15 [2018-12-01 13:59:47,134 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:47,139 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:47,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:47,145 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:59 [2018-12-01 13:59:47,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:47,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:47,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:47,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 157 [2018-12-01 13:59:47,805 INFO L478 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 132 [2018-12-01 13:59:47,806 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-01 13:59:47,849 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 142 treesize of output 115 [2018-12-01 13:59:47,850 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:47,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 115 treesize of output 96 [2018-12-01 13:59:47,887 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:47,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 72 [2018-12-01 13:59:47,921 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:59:47,957 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:59:47,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 91 [2018-12-01 13:59:47,962 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-01 13:59:47,963 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:59:47,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 97 treesize of output 79 [2018-12-01 13:59:47,964 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:47,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-01 13:59:48,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 62 [2018-12-01 13:59:48,033 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 58 treesize of output 43 [2018-12-01 13:59:48,034 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:48,057 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 43 treesize of output 32 [2018-12-01 13:59:48,057 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:48,076 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 32 treesize of output 25 [2018-12-01 13:59:48,076 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:48,094 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 43 treesize of output 26 [2018-12-01 13:59:48,094 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:48,110 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 26 treesize of output 21 [2018-12-01 13:59:48,110 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:48,119 INFO L267 ElimStorePlain]: Start of recursive call 9: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:48,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 62 [2018-12-01 13:59:48,127 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 58 treesize of output 43 [2018-12-01 13:59:48,127 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:48,147 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 43 treesize of output 36 [2018-12-01 13:59:48,148 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:48,165 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 36 treesize of output 25 [2018-12-01 13:59:48,166 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:48,182 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 43 treesize of output 32 [2018-12-01 13:59:48,182 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:48,197 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 32 treesize of output 21 [2018-12-01 13:59:48,198 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:48,207 INFO L267 ElimStorePlain]: Start of recursive call 15: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:48,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 65 [2018-12-01 13:59:48,212 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 50 treesize of output 31 [2018-12-01 13:59:48,212 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:48,222 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-12-01 13:59:48,222 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:48,230 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-12-01 13:59:48,231 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:48,236 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:48,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:48,254 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 3 variables, input treesize:211, output treesize:13 [2018-12-01 13:59:48,298 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:59:48,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:59:48,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30] total 53 [2018-12-01 13:59:48,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-01 13:59:48,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-01 13:59:48,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2602, Unknown=0, NotChecked=0, Total=2756 [2018-12-01 13:59:48,314 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 53 states. [2018-12-01 13:59:49,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:59:49,879 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-12-01 13:59:49,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-01 13:59:49,880 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 56 [2018-12-01 13:59:49,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:59:49,880 INFO L225 Difference]: With dead ends: 102 [2018-12-01 13:59:49,880 INFO L226 Difference]: Without dead ends: 102 [2018-12-01 13:59:49,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=324, Invalid=4368, Unknown=0, NotChecked=0, Total=4692 [2018-12-01 13:59:49,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-01 13:59:49,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-12-01 13:59:49,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-01 13:59:49,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-12-01 13:59:49,883 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 56 [2018-12-01 13:59:49,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:59:49,883 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-12-01 13:59:49,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-01 13:59:49,883 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-12-01 13:59:49,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-01 13:59:49,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:59:49,883 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:59:49,883 INFO L423 AbstractCegarLoop]: === Iteration 29 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:59:49,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:59:49,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1130250775, now seen corresponding path program 1 times [2018-12-01 13:59:49,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:59:49,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:59:49,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:49,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 13:59:49,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:50,225 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-01 13:59:50,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:59:50,226 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 13:59:50,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:50,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:59:50,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 13:59:50,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:50,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:50,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 13:59:50,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:50,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:50,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 13:59:50,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:50,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:50,328 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-12-01 13:59:50,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 13:59:50,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 13:59:50,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:50,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:50,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:50,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-12-01 13:59:50,430 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 37 treesize of output 33 [2018-12-01 13:59:50,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-01 13:59:50,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:50,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:50,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:59:50,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-12-01 13:59:50,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:50,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:50,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-01 13:59:50,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:50,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:59:50,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:36 [2018-12-01 13:59:51,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2018-12-01 13:59:51,058 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 59 treesize of output 51 [2018-12-01 13:59:51,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:51,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:51,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:59:51,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:67 [2018-12-01 13:59:51,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:51,241 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:59:51,243 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:59:51,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 72 [2018-12-01 13:59:51,267 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 26 treesize of output 39 [2018-12-01 13:59:51,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 13:59:51,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 13:59:51,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-01 13:59:51,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:87, output treesize:102 [2018-12-01 13:59:51,363 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 45 treesize of output 35 [2018-12-01 13:59:51,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-12-01 13:59:51,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:51,378 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 17 treesize of output 10 [2018-12-01 13:59:51,378 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:51,396 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 19 treesize of output 18 [2018-12-01 13:59:51,397 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-01 13:59:51,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 13:59:51,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:51,417 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:5 [2018-12-01 13:59:51,460 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-01 13:59:51,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:59:51,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 42 [2018-12-01 13:59:51,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-01 13:59:51,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-01 13:59:51,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1687, Unknown=0, NotChecked=0, Total=1806 [2018-12-01 13:59:51,486 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 43 states. [2018-12-01 13:59:54,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:59:54,371 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2018-12-01 13:59:54,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-01 13:59:54,372 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 57 [2018-12-01 13:59:54,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:59:54,373 INFO L225 Difference]: With dead ends: 100 [2018-12-01 13:59:54,373 INFO L226 Difference]: Without dead ends: 100 [2018-12-01 13:59:54,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=262, Invalid=3044, Unknown=0, NotChecked=0, Total=3306 [2018-12-01 13:59:54,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-01 13:59:54,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-01 13:59:54,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-01 13:59:54,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2018-12-01 13:59:54,380 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 57 [2018-12-01 13:59:54,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:59:54,381 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2018-12-01 13:59:54,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-01 13:59:54,381 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2018-12-01 13:59:54,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-01 13:59:54,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:59:54,383 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:59:54,383 INFO L423 AbstractCegarLoop]: === Iteration 30 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 13:59:54,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:59:54,384 INFO L82 PathProgramCache]: Analyzing trace with hash 678035832, now seen corresponding path program 1 times [2018-12-01 13:59:54,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:59:54,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:59:54,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:54,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:54,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:59:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:55,251 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-01 13:59:55,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:59:55,252 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 13:59:55,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:59:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:59:55,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:59:55,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 13:59:55,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:55,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:55,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 13:59:56,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 13:59:56,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 13:59:56,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:56,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:56,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:56,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-01 13:59:56,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:56,538 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 41 treesize of output 45 [2018-12-01 13:59:56,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-01 13:59:56,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:56,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:56,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:59:56,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-12-01 13:59:56,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:56,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:56,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:56,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-12-01 13:59:56,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:56,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:59:56,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:35 [2018-12-01 13:59:57,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2018-12-01 13:59:57,155 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 59 treesize of output 51 [2018-12-01 13:59:57,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:57,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:57,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:59:57,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:71 [2018-12-01 13:59:57,455 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:59:57,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:57,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:57,456 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:59:57,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 91 [2018-12-01 13:59:57,477 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 26 treesize of output 39 [2018-12-01 13:59:57,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 13:59:57,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 13:59:57,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-01 13:59:57,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:91, output treesize:110 [2018-12-01 13:59:57,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2018-12-01 13:59:57,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-01 13:59:57,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:57,806 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 12 treesize of output 4 [2018-12-01 13:59:57,806 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:57,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:57,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:59:57,821 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:49, output treesize:10 [2018-12-01 13:59:57,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:59:57,830 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-12-01 13:59:57,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:59:57,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:59:57,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-01 13:59:57,934 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 13:59:57,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:59:57,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 27] total 56 [2018-12-01 13:59:57,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-01 13:59:57,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-01 13:59:57,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3017, Unknown=0, NotChecked=0, Total=3192 [2018-12-01 13:59:57,950 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 57 states. [2018-12-01 14:00:00,427 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 39 [2018-12-01 14:00:00,774 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2018-12-01 14:00:01,846 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2018-12-01 14:00:05,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:05,594 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-12-01 14:00:05,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-01 14:00:05,594 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 58 [2018-12-01 14:00:05,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:05,595 INFO L225 Difference]: With dead ends: 100 [2018-12-01 14:00:05,595 INFO L226 Difference]: Without dead ends: 100 [2018-12-01 14:00:05,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=493, Invalid=6647, Unknown=0, NotChecked=0, Total=7140 [2018-12-01 14:00:05,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-01 14:00:05,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-01 14:00:05,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-01 14:00:05,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-12-01 14:00:05,597 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 58 [2018-12-01 14:00:05,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:05,597 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-12-01 14:00:05,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-01 14:00:05,597 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-12-01 14:00:05,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-01 14:00:05,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:05,597 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:00:05,598 INFO L423 AbstractCegarLoop]: === Iteration 31 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 14:00:05,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:05,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1952227256, now seen corresponding path program 1 times [2018-12-01 14:00:05,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:05,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:05,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:05,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:05,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:06,709 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-01 14:00:06,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:00:06,709 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:00:06,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:06,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:00:06,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 14:00:06,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:06,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:06,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 14:00:06,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:06,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:06,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 14:00:06,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:06,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:06,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-12-01 14:00:06,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 14:00:06,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 14:00:06,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:06,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:06,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 14:00:06,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 14:00:06,927 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:06,928 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:06,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:06,933 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-12-01 14:00:07,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-12-01 14:00:07,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-01 14:00:07,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:07,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:07,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-12-01 14:00:07,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-01 14:00:07,025 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:07,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:07,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:00:07,035 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:50 [2018-12-01 14:00:07,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:07,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:07,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-01 14:00:07,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:07,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:00:07,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:52 [2018-12-01 14:00:09,322 WARN L180 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 36 [2018-12-01 14:00:10,215 WARN L180 SmtUtils]: Spent 798.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-12-01 14:00:10,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:10,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 111 [2018-12-01 14:00:10,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-01 14:00:10,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:10,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 123 [2018-12-01 14:00:10,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 14:00:10,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-01 14:00:10,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:197, output treesize:385 [2018-12-01 14:00:12,997 WARN L180 SmtUtils]: Spent 2.55 s on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2018-12-01 14:00:14,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:14,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:14,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:14,753 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 14:00:14,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:14,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 174 [2018-12-01 14:00:14,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 59 [2018-12-01 14:00:14,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 14:00:14,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:14,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:14,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:14,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:14,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:14,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 137 [2018-12-01 14:00:14,820 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 138 [2018-12-01 14:00:14,821 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-01 14:00:14,871 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-01 14:00:14,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:14,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:14,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:14,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:14,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:14,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 143 [2018-12-01 14:00:14,897 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 153 [2018-12-01 14:00:14,899 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-01 14:00:14,951 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-01 14:00:15,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 6 xjuncts. [2018-12-01 14:00:15,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:15,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:15,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 157 [2018-12-01 14:00:15,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-01 14:00:15,123 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:15,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 74 [2018-12-01 14:00:15,135 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:15,144 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:15,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:15,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:15,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:15,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 119 [2018-12-01 14:00:15,150 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 72 treesize of output 58 [2018-12-01 14:00:15,151 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:15,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-01 14:00:15,163 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:15,170 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:15,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:15,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:15,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 107 [2018-12-01 14:00:15,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-01 14:00:15,177 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:15,188 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 62 treesize of output 50 [2018-12-01 14:00:15,188 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:15,198 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:15,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:15,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:15,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 97 [2018-12-01 14:00:15,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-01 14:00:15,205 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:15,215 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 49 treesize of output 39 [2018-12-01 14:00:15,216 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:15,223 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:15,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:15,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:15,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:15,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 109 [2018-12-01 14:00:15,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-01 14:00:15,231 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:15,243 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 59 treesize of output 47 [2018-12-01 14:00:15,243 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:15,251 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:15,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:15,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:15,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 139 [2018-12-01 14:00:15,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-01 14:00:15,260 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:15,271 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 65 treesize of output 55 [2018-12-01 14:00:15,271 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:15,281 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:15,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 17 dim-0 vars, and 6 xjuncts. [2018-12-01 14:00:15,343 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 12 variables, input treesize:928, output treesize:466 [2018-12-01 14:00:15,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:15,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2018-12-01 14:00:15,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-01 14:00:15,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:15,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-01 14:00:15,662 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:15,665 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 19 treesize of output 10 [2018-12-01 14:00:15,666 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:15,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:15,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:00:15,672 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:11 [2018-12-01 14:00:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-01 14:00:15,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 14:00:15,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 66 [2018-12-01 14:00:15,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-01 14:00:15,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-01 14:00:15,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=4209, Unknown=2, NotChecked=0, Total=4422 [2018-12-01 14:00:15,750 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 67 states. [2018-12-01 14:00:22,539 WARN L180 SmtUtils]: Spent 2.66 s on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-12-01 14:00:24,290 WARN L180 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-12-01 14:00:35,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:35,916 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2018-12-01 14:00:35,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-01 14:00:35,917 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2018-12-01 14:00:35,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:35,917 INFO L225 Difference]: With dead ends: 163 [2018-12-01 14:00:35,917 INFO L226 Difference]: Without dead ends: 163 [2018-12-01 14:00:35,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2889 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=908, Invalid=11296, Unknown=6, NotChecked=0, Total=12210 [2018-12-01 14:00:35,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-01 14:00:35,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 113. [2018-12-01 14:00:35,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-01 14:00:35,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2018-12-01 14:00:35,920 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 66 [2018-12-01 14:00:35,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:35,920 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2018-12-01 14:00:35,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-01 14:00:35,920 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2018-12-01 14:00:35,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-01 14:00:35,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:35,921 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:00:35,921 INFO L423 AbstractCegarLoop]: === Iteration 32 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 14:00:35,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:35,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1952227257, now seen corresponding path program 1 times [2018-12-01 14:00:35,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:35,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:35,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:35,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:35,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:36,685 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:00:36,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:00:36,685 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/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-12-01 14:00:36,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:36,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:00:36,938 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 58 [2018-12-01 14:00:36,940 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 51 treesize of output 45 [2018-12-01 14:00:36,940 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:00:36,951 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 45 treesize of output 30 [2018-12-01 14:00:36,951 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:36,965 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 45 treesize of output 38 [2018-12-01 14:00:36,965 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 14:00:36,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-01 14:00:36,997 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 34 treesize of output 32 [2018-12-01 14:00:36,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-12-01 14:00:36,999 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:37,008 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 17 treesize of output 15 [2018-12-01 14:00:37,009 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:37,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 14 [2018-12-01 14:00:37,018 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:37,023 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:37,025 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 30 treesize of output 22 [2018-12-01 14:00:37,026 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 11 [2018-12-01 14:00:37,026 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:00:37,030 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 11 treesize of output 3 [2018-12-01 14:00:37,031 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:37,033 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:37,038 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 26 treesize of output 26 [2018-12-01 14:00:37,039 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 22 treesize of output 18 [2018-12-01 14:00:37,039 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:00:37,048 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 18 treesize of output 11 [2018-12-01 14:00:37,048 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:37,059 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 18 treesize of output 18 [2018-12-01 14:00:37,059 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:37,063 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:37,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:37,070 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 2 variables, input treesize:67, output treesize:13 [2018-12-01 14:00:37,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 14:00:37,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 14:00:37,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:37,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:37,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 14:00:37,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 14:00:37,180 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:37,181 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:37,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:37,186 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:23 [2018-12-01 14:00:37,317 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 23 treesize of output 19 [2018-12-01 14:00:37,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-12-01 14:00:37,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:37,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:37,325 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 20 [2018-12-01 14:00:37,326 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 20 treesize of output 11 [2018-12-01 14:00:37,326 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:37,329 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:37,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:37,331 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2018-12-01 14:00:37,367 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 14:00:37,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 14:00:37,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 16] total 48 [2018-12-01 14:00:37,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-01 14:00:37,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-01 14:00:37,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2204, Unknown=0, NotChecked=0, Total=2352 [2018-12-01 14:00:37,382 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 49 states. [2018-12-01 14:00:38,718 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-12-01 14:00:39,077 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2018-12-01 14:00:39,538 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2018-12-01 14:00:40,010 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2018-12-01 14:00:40,545 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2018-12-01 14:00:41,761 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2018-12-01 14:00:43,000 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 53 [2018-12-01 14:00:44,178 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2018-12-01 14:00:44,647 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2018-12-01 14:00:45,022 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-12-01 14:00:45,924 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-12-01 14:00:46,381 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2018-12-01 14:00:46,850 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2018-12-01 14:00:47,219 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-12-01 14:00:48,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:48,356 INFO L93 Difference]: Finished difference Result 218 states and 233 transitions. [2018-12-01 14:00:48,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-01 14:00:48,356 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 66 [2018-12-01 14:00:48,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:48,357 INFO L225 Difference]: With dead ends: 218 [2018-12-01 14:00:48,357 INFO L226 Difference]: Without dead ends: 218 [2018-12-01 14:00:48,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2525 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=1052, Invalid=10504, Unknown=0, NotChecked=0, Total=11556 [2018-12-01 14:00:48,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-01 14:00:48,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 152. [2018-12-01 14:00:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-01 14:00:48,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 177 transitions. [2018-12-01 14:00:48,361 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 177 transitions. Word has length 66 [2018-12-01 14:00:48,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:48,361 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 177 transitions. [2018-12-01 14:00:48,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-01 14:00:48,361 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 177 transitions. [2018-12-01 14:00:48,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-01 14:00:48,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:48,362 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:00:48,362 INFO L423 AbstractCegarLoop]: === Iteration 33 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 14:00:48,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:48,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1962381513, now seen corresponding path program 1 times [2018-12-01 14:00:48,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:48,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:48,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:48,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:48,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:48,700 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-01 14:00:48,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:00:48,700 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/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-12-01 14:00:48,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:48,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:00:48,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:48,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:48,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 14:00:48,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:48,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:48,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-12-01 14:00:48,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 14:00:48,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 14:00:48,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:48,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:48,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:48,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-01 14:00:48,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-01 14:00:48,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 14:00:48,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:48,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:48,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 14:00:48,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2018-12-01 14:00:49,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-12-01 14:00:49,216 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 20 treesize of output 19 [2018-12-01 14:00:49,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:49,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:49,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:49,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-01 14:00:49,221 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 43 treesize of output 37 [2018-12-01 14:00:49,222 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 37 treesize of output 31 [2018-12-01 14:00:49,223 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:00:49,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:00:49,242 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 2 case distinctions, treesize of input 52 treesize of output 56 [2018-12-01 14:00:49,245 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 0 case distinctions, treesize of input 44 treesize of output 32 [2018-12-01 14:00:49,245 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:00:49,276 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 25 treesize of output 18 [2018-12-01 14:00:49,276 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:49,300 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 33 treesize of output 26 [2018-12-01 14:00:49,300 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:49,322 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 14:00:49,324 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-12-01 14:00:49,325 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:49,335 INFO L267 ElimStorePlain]: Start of recursive call 4: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:49,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:49,338 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:71, output treesize:11 [2018-12-01 14:00:49,411 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 15 treesize of output 11 [2018-12-01 14:00:49,412 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 11 treesize of output 3 [2018-12-01 14:00:49,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:49,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:49,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:49,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-01 14:00:49,437 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-01 14:00:49,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 14:00:49,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 47 [2018-12-01 14:00:49,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-01 14:00:49,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-01 14:00:49,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2123, Unknown=0, NotChecked=0, Total=2256 [2018-12-01 14:00:49,453 INFO L87 Difference]: Start difference. First operand 152 states and 177 transitions. Second operand 48 states. [2018-12-01 14:00:50,870 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2018-12-01 14:00:52,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:00:52,111 INFO L93 Difference]: Finished difference Result 187 states and 215 transitions. [2018-12-01 14:00:52,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-01 14:00:52,111 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 71 [2018-12-01 14:00:52,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:00:52,112 INFO L225 Difference]: With dead ends: 187 [2018-12-01 14:00:52,112 INFO L226 Difference]: Without dead ends: 187 [2018-12-01 14:00:52,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1399 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=528, Invalid=5952, Unknown=0, NotChecked=0, Total=6480 [2018-12-01 14:00:52,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-01 14:00:52,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 161. [2018-12-01 14:00:52,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-01 14:00:52,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2018-12-01 14:00:52,115 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 71 [2018-12-01 14:00:52,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:00:52,115 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2018-12-01 14:00:52,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-01 14:00:52,115 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2018-12-01 14:00:52,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-01 14:00:52,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:00:52,115 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:00:52,115 INFO L423 AbstractCegarLoop]: === Iteration 34 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 14:00:52,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:00:52,115 INFO L82 PathProgramCache]: Analyzing trace with hash 357995244, now seen corresponding path program 1 times [2018-12-01 14:00:52,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:00:52,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:00:52,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:52,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:52,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:00:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:52,407 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 14:00:52,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:00:52,407 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/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-12-01 14:00:52,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:00:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:00:52,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:00:52,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 53 [2018-12-01 14:00:52,523 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 49 treesize of output 38 [2018-12-01 14:00:52,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:52,538 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 41 treesize of output 37 [2018-12-01 14:00:52,538 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 14:00:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-12-01 14:00:52,553 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:00:52,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-01 14:00:52,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-01 14:00:52,584 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:67, output treesize:109 [2018-12-01 14:00:52,725 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 53 treesize of output 65 [2018-12-01 14:00:52,727 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:00:52,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-01 14:00:52,785 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:52,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2018-12-01 14:00:52,818 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 14:00:52,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-01 14:00:52,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 63 [2018-12-01 14:00:52,955 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:00:53,007 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 30 treesize of output 29 [2018-12-01 14:00:53,007 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:53,031 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 31 treesize of output 39 [2018-12-01 14:00:53,031 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 14:00:53,075 INFO L267 ElimStorePlain]: Start of recursive call 6: 5 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 14:00:53,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 55 [2018-12-01 14:00:53,153 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 33 treesize of output 39 [2018-12-01 14:00:53,153 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 14:00:53,206 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 30 treesize of output 29 [2018-12-01 14:00:53,206 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:53,245 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-12-01 14:00:53,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 11 dim-0 vars, and 10 xjuncts. [2018-12-01 14:00:53,331 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:148, output treesize:335 [2018-12-01 14:00:53,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-01 14:00:53,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:53,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:00:53,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:34 [2018-12-01 14:00:53,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 14:00:53,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 14:00:53,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:53,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:53,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 69 [2018-12-01 14:00:53,564 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 48 treesize of output 47 [2018-12-01 14:00:53,564 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:00:53,659 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 40 treesize of output 44 [2018-12-01 14:00:53,659 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:53,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-12-01 14:00:53,779 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:53,882 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:00:53,983 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:00:54,085 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:00:54,153 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2018-12-01 14:00:54,153 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:00:54,214 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:00:54,430 INFO L267 ElimStorePlain]: Start of recursive call 4: 9 dim-1 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-12-01 14:00:54,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 14 dim-0 vars, and 8 xjuncts. [2018-12-01 14:00:54,782 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:63, output treesize:441 [2018-12-01 14:00:55,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:55,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 69 [2018-12-01 14:00:55,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 32 [2018-12-01 14:00:55,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:55,489 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 22 treesize of output 6 [2018-12-01 14:00:55,490 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:55,496 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 19 treesize of output 10 [2018-12-01 14:00:55,496 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:55,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:55,516 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 27 treesize of output 25 [2018-12-01 14:00:55,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-01 14:00:55,518 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:55,522 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:55,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:55,537 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 66 treesize of output 58 [2018-12-01 14:00:55,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 14 [2018-12-01 14:00:55,538 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:55,547 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 11 treesize of output 3 [2018-12-01 14:00:55,547 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:55,552 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:55,562 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 29 treesize of output 25 [2018-12-01 14:00:55,563 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 12 treesize of output 4 [2018-12-01 14:00:55,563 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:55,567 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:00:55,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 14:00:55,576 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:143, output treesize:39 [2018-12-01 14:00:55,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:55,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:55,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:00:55,653 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 22 treesize of output 34 [2018-12-01 14:00:55,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 14:00:55,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 14:00:55,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:20 [2018-12-01 14:00:55,715 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 14:00:55,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 14:00:55,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 38 [2018-12-01 14:00:55,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-01 14:00:55,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-01 14:00:55,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1344, Unknown=0, NotChecked=0, Total=1482 [2018-12-01 14:00:55,730 INFO L87 Difference]: Start difference. First operand 161 states and 187 transitions. Second operand 39 states. [2018-12-01 14:00:56,884 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 66 [2018-12-01 14:00:57,749 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 73 [2018-12-01 14:00:58,027 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 66 [2018-12-01 14:00:58,249 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 67 [2018-12-01 14:00:59,658 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2018-12-01 14:00:59,979 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 25 [2018-12-01 14:01:00,272 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2018-12-01 14:01:00,497 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2018-12-01 14:01:00,829 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2018-12-01 14:01:01,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:01:01,431 INFO L93 Difference]: Finished difference Result 272 states and 309 transitions. [2018-12-01 14:01:01,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-01 14:01:01,431 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 73 [2018-12-01 14:01:01,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:01:01,432 INFO L225 Difference]: With dead ends: 272 [2018-12-01 14:01:01,432 INFO L226 Difference]: Without dead ends: 272 [2018-12-01 14:01:01,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1936 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=836, Invalid=6136, Unknown=0, NotChecked=0, Total=6972 [2018-12-01 14:01:01,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-12-01 14:01:01,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 224. [2018-12-01 14:01:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-12-01 14:01:01,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 274 transitions. [2018-12-01 14:01:01,435 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 274 transitions. Word has length 73 [2018-12-01 14:01:01,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:01:01,435 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 274 transitions. [2018-12-01 14:01:01,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-01 14:01:01,435 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 274 transitions. [2018-12-01 14:01:01,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-01 14:01:01,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:01:01,436 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-12-01 14:01:01,436 INFO L423 AbstractCegarLoop]: === Iteration 35 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 14:01:01,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:01:01,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1051390995, now seen corresponding path program 1 times [2018-12-01 14:01:01,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:01:01,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:01:01,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:01:01,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:01:01,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:01:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:01:03,078 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-01 14:01:03,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:01:03,079 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:01:03,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:01:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:01:03,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:01:03,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 14:01:03,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:03,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:01:03,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 14:01:03,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:03,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:03,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-12-01 14:01:03,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:03,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:01:03,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-12-01 14:01:03,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 11 treesize of output 8 [2018-12-01 14:01:03,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 8 treesize of output 7 [2018-12-01 14:01:03,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:03,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:01:03,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:01:03,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-12-01 14:01:03,353 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 37 treesize of output 33 [2018-12-01 14:01:03,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-01 14:01:03,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:03,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:01:03,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:03,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-12-01 14:01:03,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:03,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:03,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-01 14:01:03,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:03,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:03,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2018-12-01 14:01:04,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 330 treesize of output 222 [2018-12-01 14:01:04,664 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 2 case distinctions, treesize of input 54 treesize of output 83 [2018-12-01 14:01:04,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 14:01:04,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:04,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 261 treesize of output 201 [2018-12-01 14:01:04,705 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:04,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 189 [2018-12-01 14:01:04,795 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:04,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 181 [2018-12-01 14:01:04,932 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:05,011 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-01 14:01:05,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:05,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 253 treesize of output 205 [2018-12-01 14:01:05,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 185 [2018-12-01 14:01:05,033 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:05,114 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 175 treesize of output 177 [2018-12-01 14:01:05,114 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:05,185 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-01 14:01:05,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-12-01 14:01:05,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:06,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 178 [2018-12-01 14:01:06,005 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 40 treesize of output 39 [2018-12-01 14:01:06,005 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:06,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:06,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 145 [2018-12-01 14:01:06,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 111 [2018-12-01 14:01:06,025 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:06,034 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:06,043 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:06,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 133 [2018-12-01 14:01:06,052 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 28 treesize of output 27 [2018-12-01 14:01:06,052 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:06,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:06,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:06,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 125 [2018-12-01 14:01:06,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 84 [2018-12-01 14:01:06,073 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:06,084 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:06,092 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:06,096 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 181 treesize of output 129 [2018-12-01 14:01:06,098 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 28 treesize of output 27 [2018-12-01 14:01:06,098 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:06,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:06,110 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 128 treesize of output 105 [2018-12-01 14:01:06,113 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 0 case distinctions, treesize of input 97 treesize of output 87 [2018-12-01 14:01:06,114 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:06,122 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:06,129 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:06,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:06,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 182 [2018-12-01 14:01:06,141 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 40 treesize of output 39 [2018-12-01 14:01:06,141 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:06,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:06,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 149 [2018-12-01 14:01:06,161 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 138 treesize of output 115 [2018-12-01 14:01:06,162 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:06,172 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:06,182 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:06,186 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 177 treesize of output 125 [2018-12-01 14:01:06,188 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 28 treesize of output 27 [2018-12-01 14:01:06,188 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:06,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:06,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 99 [2018-12-01 14:01:06,203 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 0 case distinctions, treesize of input 91 treesize of output 83 [2018-12-01 14:01:06,203 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:06,215 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:06,221 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:06,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 137 [2018-12-01 14:01:06,231 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 28 treesize of output 27 [2018-12-01 14:01:06,231 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:06,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:06,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:06,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 129 [2018-12-01 14:01:06,251 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 109 treesize of output 88 [2018-12-01 14:01:06,251 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:06,262 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:06,270 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:06,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 13 dim-0 vars, and 6 xjuncts. [2018-12-01 14:01:06,345 INFO L202 ElimStorePlain]: Needed 34 recursive calls to eliminate 3 variables, input treesize:333, output treesize:578 [2018-12-01 14:01:07,204 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 91 [2018-12-01 14:01:07,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-01 14:01:07,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:07,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2018-12-01 14:01:07,216 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:07,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:01:07,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 109 [2018-12-01 14:01:07,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 32 [2018-12-01 14:01:07,251 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:07,264 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 31 treesize of output 23 [2018-12-01 14:01:07,264 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:07,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 53 treesize of output 38 [2018-12-01 14:01:07,273 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:07,282 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:01:07,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2018-12-01 14:01:07,303 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 17 treesize of output 13 [2018-12-01 14:01:07,303 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:07,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-01 14:01:07,310 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:07,316 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 11 treesize of output 3 [2018-12-01 14:01:07,316 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:07,321 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:01:07,334 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 56 treesize of output 40 [2018-12-01 14:01:07,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2018-12-01 14:01:07,336 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:07,341 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 11 treesize of output 3 [2018-12-01 14:01:07,341 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:07,344 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:01:07,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:01:07,356 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 9 variables, input treesize:243, output treesize:7 [2018-12-01 14:01:07,405 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-01 14:01:07,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 14:01:07,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 59 [2018-12-01 14:01:07,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-01 14:01:07,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-01 14:01:07,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=3246, Unknown=0, NotChecked=0, Total=3422 [2018-12-01 14:01:07,420 INFO L87 Difference]: Start difference. First operand 224 states and 274 transitions. Second operand 59 states. [2018-12-01 14:01:11,334 WARN L180 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2018-12-01 14:01:13,068 WARN L180 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 119 DAG size of output: 63 [2018-12-01 14:01:22,719 WARN L180 SmtUtils]: Spent 9.55 s on a formula simplification. DAG size of input: 129 DAG size of output: 71 [2018-12-01 14:01:32,251 WARN L180 SmtUtils]: Spent 9.42 s on a formula simplification. DAG size of input: 136 DAG size of output: 79 [2018-12-01 14:01:35,254 WARN L180 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 144 DAG size of output: 75 [2018-12-01 14:01:35,766 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 83 [2018-12-01 14:01:36,048 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 92 [2018-12-01 14:01:39,486 WARN L180 SmtUtils]: Spent 3.32 s on a formula simplification. DAG size of input: 141 DAG size of output: 72 [2018-12-01 14:01:39,745 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 96 [2018-12-01 14:01:41,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:01:41,163 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2018-12-01 14:01:41,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-01 14:01:41,163 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 77 [2018-12-01 14:01:41,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:01:41,164 INFO L225 Difference]: With dead ends: 208 [2018-12-01 14:01:41,164 INFO L226 Difference]: Without dead ends: 198 [2018-12-01 14:01:41,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 7 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2253 ImplicationChecksByTransitivity, 35.5s TimeCoverageRelationStatistics Valid=797, Invalid=8905, Unknown=0, NotChecked=0, Total=9702 [2018-12-01 14:01:41,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-01 14:01:41,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 188. [2018-12-01 14:01:41,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-01 14:01:41,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 216 transitions. [2018-12-01 14:01:41,166 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 216 transitions. Word has length 77 [2018-12-01 14:01:41,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:01:41,166 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 216 transitions. [2018-12-01 14:01:41,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-01 14:01:41,166 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 216 transitions. [2018-12-01 14:01:41,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-01 14:01:41,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:01:41,167 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:01:41,167 INFO L423 AbstractCegarLoop]: === Iteration 36 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 14:01:41,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:01:41,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1849361539, now seen corresponding path program 1 times [2018-12-01 14:01:41,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:01:41,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:01:41,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:01:41,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:01:41,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:01:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:01:43,898 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-01 14:01:43,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:01:43,899 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:01:43,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:01:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:01:43,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:01:44,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 14:01:44,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 14:01:44,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:44,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:01:44,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:01:44,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-12-01 14:01:44,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:44,796 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 54 treesize of output 58 [2018-12-01 14:01:44,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-01 14:01:44,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:44,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 14:01:44,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:44,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-12-01 14:01:50,797 WARN L180 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-01 14:01:51,375 WARN L180 SmtUtils]: Spent 485.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-12-01 14:01:51,934 WARN L180 SmtUtils]: Spent 463.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-12-01 14:01:53,008 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_circular_remove_first_~last~1.offset Int)) (let ((.cse2 (select (select |c_old(#memory_$Pointer$.base)| (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_remove_first_#in~head.base|) |c_sll_circular_remove_first_#in~head.offset|)) (select (select |c_old(#memory_$Pointer$.offset)| |c_sll_circular_remove_first_#in~head.base|) |c_sll_circular_remove_first_#in~head.offset|)))) (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| .cse2 (store (select |c_old(#memory_$Pointer$.base)| .cse2) sll_circular_remove_first_~last~1.offset .cse2)))) (let ((.cse0 (select .cse1 |c_sll_circular_remove_first_#in~head.base|))) (and (= |c_#valid| (store |c_old(#valid)| (select .cse0 |c_sll_circular_remove_first_#in~head.offset|) 0)) (= |c_#memory_$Pointer$.base| (store .cse1 |c_sll_circular_remove_first_#in~head.base| (store .cse0 |c_sll_circular_remove_first_#in~head.offset| .cse2)))))))) is different from true [2018-12-01 14:01:53,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:53,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:53,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:53,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 162 [2018-12-01 14:01:53,066 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 2 case distinctions, treesize of input 42 treesize of output 59 [2018-12-01 14:01:53,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 14:01:53,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:53,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:53,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:53,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:53,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 142 [2018-12-01 14:01:53,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 122 [2018-12-01 14:01:53,097 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:53,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:53,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:53,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:53,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:53,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:53,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 148 [2018-12-01 14:01:53,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 137 [2018-12-01 14:01:53,120 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:53,130 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:53,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 14:01:53,177 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 109 treesize of output 95 [2018-12-01 14:01:53,179 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 81 [2018-12-01 14:01:53,179 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:53,188 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:53,189 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 97 treesize of output 85 [2018-12-01 14:01:53,191 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 82 treesize of output 70 [2018-12-01 14:01:53,191 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:53,199 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:53,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-12-01 14:01:53,225 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:269, output treesize:168 [2018-12-01 14:01:53,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:53,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:53,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 14:01:53,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 78 [2018-12-01 14:01:53,702 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 27 treesize of output 19 [2018-12-01 14:01:53,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:53,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-01 14:01:53,712 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 14:01:53,719 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 43 treesize of output 35 [2018-12-01 14:01:53,719 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:53,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:53,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 14:01:53,736 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:82, output treesize:40 [2018-12-01 14:02:00,527 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 2 not checked. [2018-12-01 14:02:00,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 14:02:00,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 35] total 72 [2018-12-01 14:02:00,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-01 14:02:00,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-01 14:02:00,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=4849, Unknown=18, NotChecked=140, Total=5256 [2018-12-01 14:02:00,542 INFO L87 Difference]: Start difference. First operand 188 states and 216 transitions. Second operand 73 states. [2018-12-01 14:02:02,200 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 55 [2018-12-01 14:02:02,483 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 60 [2018-12-01 14:02:02,793 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 63 [2018-12-01 14:02:14,920 WARN L180 SmtUtils]: Spent 794.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2018-12-01 14:02:15,915 WARN L180 SmtUtils]: Spent 899.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2018-12-01 14:02:16,976 WARN L180 SmtUtils]: Spent 940.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2018-12-01 14:02:18,787 WARN L180 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2018-12-01 14:02:32,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:02:32,994 INFO L93 Difference]: Finished difference Result 200 states and 227 transitions. [2018-12-01 14:02:32,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-01 14:02:32,995 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 80 [2018-12-01 14:02:32,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:02:32,995 INFO L225 Difference]: With dead ends: 200 [2018-12-01 14:02:32,995 INFO L226 Difference]: Without dead ends: 197 [2018-12-01 14:02:32,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2052 ImplicationChecksByTransitivity, 31.3s TimeCoverageRelationStatistics Valid=583, Invalid=10308, Unknown=33, NotChecked=206, Total=11130 [2018-12-01 14:02:32,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-01 14:02:32,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 190. [2018-12-01 14:02:32,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-01 14:02:32,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 218 transitions. [2018-12-01 14:02:32,998 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 218 transitions. Word has length 80 [2018-12-01 14:02:32,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:02:32,999 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 218 transitions. [2018-12-01 14:02:32,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-01 14:02:32,999 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 218 transitions. [2018-12-01 14:02:32,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-01 14:02:32,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:02:32,999 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:02:33,000 INFO L423 AbstractCegarLoop]: === Iteration 37 === [sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2018-12-01 14:02:33,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:02:33,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1490387668, now seen corresponding path program 1 times [2018-12-01 14:02:33,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:02:33,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:02:33,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:02:33,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:02:33,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:02:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:02:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-01 14:02:33,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:02:33,026 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:02:33,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:02:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:02:33,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:02:33,079 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-01 14:02:33,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 14:02:33,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2018-12-01 14:02:33,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 14:02:33,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 14:02:33,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-01 14:02:33,094 INFO L87 Difference]: Start difference. First operand 190 states and 218 transitions. Second operand 9 states. [2018-12-01 14:02:33,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:02:33,106 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-01 14:02:33,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 14:02:33,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2018-12-01 14:02:33,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:02:33,107 INFO L225 Difference]: With dead ends: 70 [2018-12-01 14:02:33,107 INFO L226 Difference]: Without dead ends: 0 [2018-12-01 14:02:33,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-01 14:02:33,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-01 14:02:33,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-01 14:02:33,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-01 14:02:33,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 14:02:33,107 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2018-12-01 14:02:33,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:02:33,107 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 14:02:33,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 14:02:33,108 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-01 14:02:33,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-01 14:02:33,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 02:02:33 BoogieIcfgContainer [2018-12-01 14:02:33,111 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 14:02:33,111 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 14:02:33,111 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 14:02:33,111 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 14:02:33,111 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:57:03" (3/4) ... [2018-12-01 14:02:33,113 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-01 14:02:33,118 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-01 14:02:33,118 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-12-01 14:02:33,118 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_remove_first [2018-12-01 14:02:33,118 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-01 14:02:33,118 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-01 14:02:33,118 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_create [2018-12-01 14:02:33,118 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-01 14:02:33,118 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-12-01 14:02:33,121 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-12-01 14:02:33,122 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-01 14:02:33,122 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-01 14:02:33,149 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_15ab5916-a2a2-481c-a0f4-4c6771d6beb2/bin-2019/uautomizer/witness.graphml [2018-12-01 14:02:33,149 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 14:02:33,150 INFO L168 Benchmark]: Toolchain (without parser) took 329980.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 950.6 MB in the beginning and 827.9 MB in the end (delta: 122.8 MB). Peak memory consumption was 277.9 MB. Max. memory is 11.5 GB. [2018-12-01 14:02:33,150 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 14:02:33,150 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -152.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-01 14:02:33,150 INFO L168 Benchmark]: Boogie Preprocessor took 40.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 14:02:33,151 INFO L168 Benchmark]: RCFGBuilder took 312.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2018-12-01 14:02:33,151 INFO L168 Benchmark]: TraceAbstraction took 329312.66 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 36.2 MB). Free memory was 1.0 GB in the beginning and 834.5 MB in the end (delta: 208.5 MB). Peak memory consumption was 244.7 MB. Max. memory is 11.5 GB. [2018-12-01 14:02:33,151 INFO L168 Benchmark]: Witness Printer took 38.54 ms. Allocated memory is still 1.2 GB. Free memory was 834.5 MB in the beginning and 827.9 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-01 14:02:33,152 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 274.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -152.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 312.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 329312.66 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 36.2 MB). Free memory was 1.0 GB in the beginning and 834.5 MB in the end (delta: 208.5 MB). Peak memory consumption was 244.7 MB. Max. memory is 11.5 GB. * Witness Printer took 38.54 ms. Allocated memory is still 1.2 GB. Free memory was 834.5 MB in the beginning and 827.9 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 587]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 591]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 591]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 591]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 591]: 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: 596]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 596]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 585]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 585]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 585]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 585]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 599]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: 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: 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 - AllSpecificationsHoldResult: All specifications hold 39 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 111 locations, 39 error locations. SAFE Result, 329.2s OverallTime, 37 OverallIterations, 3 TraceHistogramMax, 260.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2052 SDtfs, 5893 SDslu, 16778 SDs, 0 SdLazy, 35863 SolverSat, 1238 SolverUnsat, 131 SolverUnknown, 0 SolverNotchecked, 161.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2365 GetRequests, 928 SyntacticMatches, 59 SemanticMatches, 1378 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 20931 ImplicationChecksByTransitivity, 151.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=34, 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, 37 MinimizatonAttempts, 519 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 66.4s InterpolantComputationTime, 3013 NumberOfCodeBlocks, 3013 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 2954 ConstructedInterpolants, 284 QuantifiedInterpolants, 3591766 SizeOfPredicates, 424 NumberOfNonLiveVariables, 7074 ConjunctsInSsa, 1521 ConjunctsInUnsatCore, 59 InterpolantComputations, 16 PerfectInterpolantSequences, 377/745 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...