./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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/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_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/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-0cd3be1 [2018-11-28 12:23:14,182 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:23:14,183 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:23:14,190 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:23:14,191 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:23:14,191 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:23:14,192 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:23:14,193 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:23:14,194 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:23:14,194 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:23:14,195 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:23:14,195 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:23:14,196 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:23:14,196 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:23:14,197 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:23:14,198 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:23:14,198 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:23:14,199 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:23:14,201 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:23:14,202 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:23:14,203 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:23:14,203 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:23:14,205 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:23:14,205 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:23:14,205 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:23:14,206 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:23:14,206 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:23:14,207 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:23:14,207 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:23:14,208 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:23:14,208 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:23:14,209 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:23:14,209 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:23:14,209 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:23:14,209 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:23:14,210 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:23:14,210 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 12:23:14,220 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:23:14,220 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:23:14,221 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:23:14,221 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:23:14,221 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:23:14,221 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:23:14,221 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:23:14,222 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:23:14,222 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:23:14,222 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:23:14,222 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:23:14,222 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:23:14,222 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:23:14,223 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 12:23:14,223 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 12:23:14,223 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 12:23:14,223 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:23:14,223 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:23:14,223 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:23:14,223 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:23:14,224 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:23:14,224 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:23:14,224 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:23:14,224 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:23:14,224 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:23:14,224 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:23:14,224 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:23:14,225 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:23:14,225 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_18a8b62f-8d00-4096-9641-3a5c203e4ecd/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-11-28 12:23:14,248 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:23:14,257 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:23:14,260 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:23:14,261 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:23:14,262 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:23:14,262 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2c_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-28 12:23:14,300 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/data/01a53dddf/ac6cebf1ba25491cbeed1e0809cbfbab/FLAG44aa3a8a9 [2018-11-28 12:23:14,716 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:23:14,717 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/sv-benchmarks/c/list-simple/sll2c_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-28 12:23:14,723 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/data/01a53dddf/ac6cebf1ba25491cbeed1e0809cbfbab/FLAG44aa3a8a9 [2018-11-28 12:23:14,732 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/data/01a53dddf/ac6cebf1ba25491cbeed1e0809cbfbab [2018-11-28 12:23:14,734 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:23:14,735 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 12:23:14,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:23:14,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:23:14,739 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:23:14,740 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:23:14" (1/1) ... [2018-11-28 12:23:14,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5358de84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:23:14, skipping insertion in model container [2018-11-28 12:23:14,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:23:14" (1/1) ... [2018-11-28 12:23:14,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:23:14,774 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:23:14,950 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:23:15,003 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:23:15,033 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:23:15,059 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:23:15,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:23:15 WrapperNode [2018-11-28 12:23:15,059 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:23:15,060 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:23:15,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:23:15,060 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:23:15,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:23:15" (1/1) ... [2018-11-28 12:23:15,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:23:15" (1/1) ... [2018-11-28 12:23:15,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:23:15" (1/1) ... [2018-11-28 12:23:15,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:23:15" (1/1) ... [2018-11-28 12:23:15,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:23:15" (1/1) ... [2018-11-28 12:23:15,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:23:15" (1/1) ... [2018-11-28 12:23:15,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:23:15" (1/1) ... [2018-11-28 12:23:15,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:23:15,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:23:15,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:23:15,101 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:23:15,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:23:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:23:15,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 12:23:15,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:23:15,136 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 12:23:15,136 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 12:23:15,136 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-11-28 12:23:15,136 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-28 12:23:15,136 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-11-28 12:23:15,136 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_remove_first [2018-11-28 12:23:15,136 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 12:23:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 12:23:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 12:23:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 12:23:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 12:23:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 12:23:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 12:23:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 12:23:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 12:23:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 12:23:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 12:23:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 12:23:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 12:23:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 12:23:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 12:23:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 12:23:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 12:23:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 12:23:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 12:23:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 12:23:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 12:23:15,139 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 12:23:15,139 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 12:23:15,139 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 12:23:15,139 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 12:23:15,139 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 12:23:15,139 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 12:23:15,139 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 12:23:15,140 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 12:23:15,140 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 12:23:15,140 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 12:23:15,140 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 12:23:15,140 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 12:23:15,140 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 12:23:15,140 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 12:23:15,140 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 12:23:15,141 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 12:23:15,141 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 12:23:15,141 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 12:23:15,141 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 12:23:15,141 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 12:23:15,141 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 12:23:15,141 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 12:23:15,142 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 12:23:15,142 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 12:23:15,142 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 12:23:15,142 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 12:23:15,142 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 12:23:15,142 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 12:23:15,142 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 12:23:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 12:23:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 12:23:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 12:23:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 12:23:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 12:23:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 12:23:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 12:23:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 12:23:15,144 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 12:23:15,144 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 12:23:15,144 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 12:23:15,144 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 12:23:15,144 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-28 12:23:15,144 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 12:23:15,144 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 12:23:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-28 12:23:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 12:23:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 12:23:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-28 12:23:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 12:23:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 12:23:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 12:23:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 12:23:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 12:23:15,146 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 12:23:15,146 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 12:23:15,146 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 12:23:15,146 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 12:23:15,146 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 12:23:15,146 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 12:23:15,146 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 12:23:15,146 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 12:23:15,146 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 12:23:15,146 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 12:23:15,147 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 12:23:15,147 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 12:23:15,147 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 12:23:15,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 12:23:15,147 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 12:23:15,147 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 12:23:15,147 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 12:23:15,147 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 12:23:15,147 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 12:23:15,147 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 12:23:15,148 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 12:23:15,148 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 12:23:15,148 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 12:23:15,148 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 12:23:15,148 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 12:23:15,148 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 12:23:15,148 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 12:23:15,148 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 12:23:15,148 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 12:23:15,149 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 12:23:15,149 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 12:23:15,149 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 12:23:15,149 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 12:23:15,149 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-11-28 12:23:15,149 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-28 12:23:15,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:23:15,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 12:23:15,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:23:15,149 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-11-28 12:23:15,150 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_remove_first [2018-11-28 12:23:15,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 12:23:15,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:23:15,150 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 12:23:15,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 12:23:15,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 12:23:15,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:23:15,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:23:15,604 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:23:15,604 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-28 12:23:15,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:23:15 BoogieIcfgContainer [2018-11-28 12:23:15,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:23:15,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:23:15,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:23:15,608 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:23:15,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:23:14" (1/3) ... [2018-11-28 12:23:15,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b55e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:23:15, skipping insertion in model container [2018-11-28 12:23:15,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:23:15" (2/3) ... [2018-11-28 12:23:15,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b55e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:23:15, skipping insertion in model container [2018-11-28 12:23:15,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:23:15" (3/3) ... [2018-11-28 12:23:15,611 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-28 12:23:15,617 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:23:15,623 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-11-28 12:23:15,633 INFO L257 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2018-11-28 12:23:15,649 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:23:15,650 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:23:15,650 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 12:23:15,650 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:23:15,650 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:23:15,650 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:23:15,650 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:23:15,650 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:23:15,650 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:23:15,663 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2018-11-28 12:23:15,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 12:23:15,670 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:23:15,671 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:23:15,672 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:23:15,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:23:15,677 INFO L82 PathProgramCache]: Analyzing trace with hash 926435682, now seen corresponding path program 1 times [2018-11-28 12:23:15,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:23:15,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:23:15,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:23:15,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:23:15,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:23:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:23:15,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:23:15,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:23:15,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:23:15,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:23:15,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:23:15,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:23:15,808 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 3 states. [2018-11-28 12:23:15,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:23:15,906 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-11-28 12:23:15,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:23:15,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-28 12:23:15,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:23:15,913 INFO L225 Difference]: With dead ends: 101 [2018-11-28 12:23:15,913 INFO L226 Difference]: Without dead ends: 94 [2018-11-28 12:23:15,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:23:15,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-28 12:23:15,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-11-28 12:23:15,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-28 12:23:15,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2018-11-28 12:23:15,941 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 12 [2018-11-28 12:23:15,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:23:15,941 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-11-28 12:23:15,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:23:15,941 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2018-11-28 12:23:15,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 12:23:15,942 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:23:15,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:23:15,942 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:23:15,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:23:15,943 INFO L82 PathProgramCache]: Analyzing trace with hash 926435683, now seen corresponding path program 1 times [2018-11-28 12:23:15,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:23:15,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:23:15,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:23:15,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:23:15,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:23:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:23:16,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:23:16,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:23:16,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:23:16,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:23:16,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:23:16,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:23:16,002 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 3 states. [2018-11-28 12:23:16,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:23:16,077 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-11-28 12:23:16,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:23:16,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-28 12:23:16,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:23:16,078 INFO L225 Difference]: With dead ends: 92 [2018-11-28 12:23:16,078 INFO L226 Difference]: Without dead ends: 92 [2018-11-28 12:23:16,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:23:16,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-28 12:23:16,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-28 12:23:16,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-28 12:23:16,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-11-28 12:23:16,085 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 12 [2018-11-28 12:23:16,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:23:16,085 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-11-28 12:23:16,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:23:16,086 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-28 12:23:16,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 12:23:16,086 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:23:16,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:23:16,086 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:23:16,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:23:16,086 INFO L82 PathProgramCache]: Analyzing trace with hash 694828250, now seen corresponding path program 1 times [2018-11-28 12:23:16,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:23:16,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:23:16,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:23:16,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:23:16,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:23:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:23:16,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:23:16,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:23:16,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:23:16,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:23:16,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:23:16,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:23:16,171 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 6 states. [2018-11-28 12:23:16,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:23:16,315 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-11-28 12:23:16,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:23:16,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-28 12:23:16,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:23:16,317 INFO L225 Difference]: With dead ends: 96 [2018-11-28 12:23:16,317 INFO L226 Difference]: Without dead ends: 96 [2018-11-28 12:23:16,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:23:16,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-28 12:23:16,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-11-28 12:23:16,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-28 12:23:16,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2018-11-28 12:23:16,325 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 19 [2018-11-28 12:23:16,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:23:16,325 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2018-11-28 12:23:16,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:23:16,325 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2018-11-28 12:23:16,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 12:23:16,326 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:23:16,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:23:16,326 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:23:16,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:23:16,327 INFO L82 PathProgramCache]: Analyzing trace with hash 694828251, now seen corresponding path program 1 times [2018-11-28 12:23:16,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:23:16,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:23:16,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:23:16,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:23:16,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:23:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:23:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:23:16,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:23:16,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:23:16,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:23:16,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:23:16,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:23:16,382 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 5 states. [2018-11-28 12:23:16,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:23:16,402 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-11-28 12:23:16,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:23:16,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-28 12:23:16,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:23:16,403 INFO L225 Difference]: With dead ends: 93 [2018-11-28 12:23:16,403 INFO L226 Difference]: Without dead ends: 93 [2018-11-28 12:23:16,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:23:16,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-28 12:23:16,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-28 12:23:16,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-28 12:23:16,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-11-28 12:23:16,408 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 19 [2018-11-28 12:23:16,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:23:16,409 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-11-28 12:23:16,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:23:16,409 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-28 12:23:16,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 12:23:16,409 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:23:16,409 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-11-28 12:23:16,410 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:23:16,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:23:16,410 INFO L82 PathProgramCache]: Analyzing trace with hash 32148750, now seen corresponding path program 1 times [2018-11-28 12:23:16,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:23:16,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:23:16,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:23:16,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:23:16,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:23:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:23:16,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:23:16,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:23:16,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:23:16,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:23:16,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:23:16,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:23:16,467 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 6 states. [2018-11-28 12:23:16,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:23:16,578 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-11-28 12:23:16,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:23:16,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-28 12:23:16,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:23:16,579 INFO L225 Difference]: With dead ends: 93 [2018-11-28 12:23:16,579 INFO L226 Difference]: Without dead ends: 93 [2018-11-28 12:23:16,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:23:16,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-28 12:23:16,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-11-28 12:23:16,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-28 12:23:16,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-11-28 12:23:16,583 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 28 [2018-11-28 12:23:16,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:23:16,583 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-11-28 12:23:16,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:23:16,584 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-28 12:23:16,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 12:23:16,584 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:23:16,584 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-11-28 12:23:16,584 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:23:16,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:23:16,584 INFO L82 PathProgramCache]: Analyzing trace with hash 32148751, now seen corresponding path program 1 times [2018-11-28 12:23:16,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:23:16,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:23:16,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:23:16,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:23:16,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:23:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:23:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:23:16,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:23:16,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:23:16,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:23:16,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:23:16,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:23:16,647 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 6 states. [2018-11-28 12:23:16,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:23:16,759 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-11-28 12:23:16,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:23:16,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-28 12:23:16,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:23:16,761 INFO L225 Difference]: With dead ends: 92 [2018-11-28 12:23:16,761 INFO L226 Difference]: Without dead ends: 92 [2018-11-28 12:23:16,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:23:16,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-28 12:23:16,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-11-28 12:23:16,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-28 12:23:16,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-11-28 12:23:16,766 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 28 [2018-11-28 12:23:16,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:23:16,767 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-11-28 12:23:16,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:23:16,767 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-11-28 12:23:16,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 12:23:16,767 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:23:16,768 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-11-28 12:23:16,770 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:23:16,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:23:16,770 INFO L82 PathProgramCache]: Analyzing trace with hash -34254296, now seen corresponding path program 1 times [2018-11-28 12:23:16,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:23:16,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:23:16,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:23:16,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:23:16,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:23:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:23:16,920 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:23:16,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:23:16,921 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:23:16,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:23:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:23:16,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:23:18,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 12:23:18,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:23:18,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:23:18,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-11-28 12:23:18,178 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:23:18,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:23:18,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-11-28 12:23:18,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 12:23:18,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 12:23:18,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=96, Unknown=4, NotChecked=0, Total=132 [2018-11-28 12:23:18,197 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 12 states. [2018-11-28 12:23:18,531 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-28 12:23:18,800 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-28 12:23:18,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:23:18,939 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-11-28 12:23:18,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 12:23:18,940 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-28 12:23:18,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:23:18,941 INFO L225 Difference]: With dead ends: 91 [2018-11-28 12:23:18,941 INFO L226 Difference]: Without dead ends: 91 [2018-11-28 12:23:18,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=58, Invalid=178, Unknown=4, NotChecked=0, Total=240 [2018-11-28 12:23:18,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-28 12:23:18,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-11-28 12:23:18,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-28 12:23:18,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-11-28 12:23:18,946 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 31 [2018-11-28 12:23:18,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:23:18,946 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-11-28 12:23:18,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 12:23:18,946 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-28 12:23:18,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 12:23:18,947 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:23:18,947 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-11-28 12:23:18,947 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:23:18,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:23:18,948 INFO L82 PathProgramCache]: Analyzing trace with hash -34254295, now seen corresponding path program 1 times [2018-11-28 12:23:18,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:23:18,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:23:18,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:23:18,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:23:18,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:23:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:23:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:23:19,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:23:19,111 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:23:19,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:23:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:23:19,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:23:19,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:23:19,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:23:19,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:23:19,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 12:23:19,485 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-11-28 12:23:19,492 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-11-28 12:23:19,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:23:19,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:23:19,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:17 [2018-11-28 12:23:19,513 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2018-11-28 12:23:19,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:23:19,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-11-28 12:23:19,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 12:23:19,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 12:23:19,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2018-11-28 12:23:19,539 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 14 states. [2018-11-28 12:23:20,090 WARN L180 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2018-11-28 12:23:20,633 WARN L180 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2018-11-28 12:23:20,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:23:20,874 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-11-28 12:23:20,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:23:20,876 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-11-28 12:23:20,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:23:20,877 INFO L225 Difference]: With dead ends: 90 [2018-11-28 12:23:20,877 INFO L226 Difference]: Without dead ends: 90 [2018-11-28 12:23:20,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=57, Invalid=218, Unknown=1, NotChecked=30, Total=306 [2018-11-28 12:23:20,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-28 12:23:20,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-28 12:23:20,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-28 12:23:20,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-28 12:23:20,880 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 31 [2018-11-28 12:23:20,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:23:20,880 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-28 12:23:20,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 12:23:20,880 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-28 12:23:20,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 12:23:20,881 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:23:20,881 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-11-28 12:23:20,881 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:23:20,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:23:20,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1270838546, now seen corresponding path program 1 times [2018-11-28 12:23:20,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:23:20,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:23:20,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:23:20,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:23:20,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:23:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:23:20,910 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 12:23:20,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:23:20,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:23:20,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:23:20,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:23:20,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:23:20,911 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 4 states. [2018-11-28 12:23:20,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:23:20,922 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-11-28 12:23:20,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:23:20,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-28 12:23:20,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:23:20,924 INFO L225 Difference]: With dead ends: 92 [2018-11-28 12:23:20,924 INFO L226 Difference]: Without dead ends: 92 [2018-11-28 12:23:20,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:23:20,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-28 12:23:20,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-11-28 12:23:20,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-28 12:23:20,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-11-28 12:23:20,928 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 37 [2018-11-28 12:23:20,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:23:20,928 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-11-28 12:23:20,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:23:20,928 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-28 12:23:20,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 12:23:20,929 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:23:20,929 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-11-28 12:23:20,929 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:23:20,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:23:20,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1505300450, now seen corresponding path program 1 times [2018-11-28 12:23:20,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:23:20,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:23:20,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:23:20,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:23:20,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:23:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:23:21,084 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:23:21,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:23:21,084 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:23:21,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:23:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:23:21,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:23:21,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:23:21,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:23:21,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:23:21,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 12:23:21,967 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:23:21,968 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:23:21,969 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-11-28 12:23:21,972 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-11-28 12:23:21,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:23:21,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:23:21,981 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-11-28 12:23:21,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:20 [2018-11-28 12:23:22,027 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:23:22,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:23:22,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-11-28 12:23:22,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 12:23:22,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 12:23:22,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=244, Unknown=3, NotChecked=0, Total=306 [2018-11-28 12:23:22,042 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 18 states. [2018-11-28 12:23:33,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:23:33,590 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2018-11-28 12:23:33,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 12:23:33,591 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-11-28 12:23:33,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:23:33,592 INFO L225 Difference]: With dead ends: 137 [2018-11-28 12:23:33,592 INFO L226 Difference]: Without dead ends: 137 [2018-11-28 12:23:33,592 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-11-28 12:23:33,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-28 12:23:33,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 99. [2018-11-28 12:23:33,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-28 12:23:33,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-11-28 12:23:33,597 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 39 [2018-11-28 12:23:33,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:23:33,597 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-11-28 12:23:33,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 12:23:33,597 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-11-28 12:23:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 12:23:33,598 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:23:33,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, 1, 1] [2018-11-28 12:23:33,599 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:23:33,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:23:33,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1505300451, now seen corresponding path program 1 times [2018-11-28 12:23:33,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:23:33,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:23:33,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:23:33,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:23:33,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:23:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:23:33,746 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:23:33,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:23:33,746 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:23:33,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:23:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:23:33,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:23:33,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:23:33,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:23:33,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:23:33,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:23:33,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:23:33,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-28 12:23:38,734 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:23:38,736 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:23:38,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 12:23:38,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:23:38,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:23:38,745 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-11-28 12:23:38,752 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-11-28 12:23:38,753 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 12:23:38,765 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:23:38,781 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-11-28 12:23:38,782 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:33, output treesize:42 [2018-11-28 12:23:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:23:38,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:23:38,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2018-11-28 12:23:38,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 12:23:38,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 12:23:38,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=245, Unknown=4, NotChecked=0, Total=306 [2018-11-28 12:23:38,894 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 18 states. [2018-11-28 12:24:02,849 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2018-11-28 12:24:06,713 WARN L180 SmtUtils]: Spent 3.85 s on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2018-11-28 12:24:10,838 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2018-11-28 12:25:24,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:24,520 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2018-11-28 12:25:24,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 12:25:24,521 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-11-28 12:25:24,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:24,521 INFO L225 Difference]: With dead ends: 146 [2018-11-28 12:25:24,521 INFO L226 Difference]: Without dead ends: 146 [2018-11-28 12:25:24,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=117, Invalid=430, Unknown=5, NotChecked=0, Total=552 [2018-11-28 12:25:24,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-28 12:25:24,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 127. [2018-11-28 12:25:24,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-28 12:25:24,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 153 transitions. [2018-11-28 12:25:24,524 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 153 transitions. Word has length 39 [2018-11-28 12:25:24,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:24,524 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 153 transitions. [2018-11-28 12:25:24,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 12:25:24,525 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 153 transitions. [2018-11-28 12:25:24,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 12:25:24,525 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:24,525 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-11-28 12:25:24,525 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:25:24,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:24,525 INFO L82 PathProgramCache]: Analyzing trace with hash -580326251, now seen corresponding path program 1 times [2018-11-28 12:25:24,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:24,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:24,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:24,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:24,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:24,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:25:24,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:24,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 12:25:24,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 12:25:24,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 12:25:24,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:25:24,623 INFO L87 Difference]: Start difference. First operand 127 states and 153 transitions. Second operand 13 states. [2018-11-28 12:25:24,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:24,894 INFO L93 Difference]: Finished difference Result 175 states and 215 transitions. [2018-11-28 12:25:24,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 12:25:24,894 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-28 12:25:24,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:24,895 INFO L225 Difference]: With dead ends: 175 [2018-11-28 12:25:24,895 INFO L226 Difference]: Without dead ends: 175 [2018-11-28 12:25:24,895 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-11-28 12:25:24,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-28 12:25:24,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 132. [2018-11-28 12:25:24,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-28 12:25:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 163 transitions. [2018-11-28 12:25:24,900 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 163 transitions. Word has length 40 [2018-11-28 12:25:24,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:24,900 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 163 transitions. [2018-11-28 12:25:24,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 12:25:24,900 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 163 transitions. [2018-11-28 12:25:24,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 12:25:24,900 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:24,900 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-11-28 12:25:24,901 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:25:24,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:24,901 INFO L82 PathProgramCache]: Analyzing trace with hash -580326250, now seen corresponding path program 1 times [2018-11-28 12:25:24,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:24,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:24,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:24,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:24,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:25:25,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:25,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 12:25:25,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 12:25:25,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 12:25:25,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:25:25,036 INFO L87 Difference]: Start difference. First operand 132 states and 163 transitions. Second operand 13 states. [2018-11-28 12:25:25,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:25,368 INFO L93 Difference]: Finished difference Result 178 states and 218 transitions. [2018-11-28 12:25:25,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 12:25:25,369 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-28 12:25:25,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:25,370 INFO L225 Difference]: With dead ends: 178 [2018-11-28 12:25:25,370 INFO L226 Difference]: Without dead ends: 178 [2018-11-28 12:25:25,370 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-11-28 12:25:25,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-28 12:25:25,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 132. [2018-11-28 12:25:25,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-28 12:25:25,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 161 transitions. [2018-11-28 12:25:25,376 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 161 transitions. Word has length 40 [2018-11-28 12:25:25,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:25,376 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 161 transitions. [2018-11-28 12:25:25,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 12:25:25,376 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 161 transitions. [2018-11-28 12:25:25,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 12:25:25,377 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:25,377 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-11-28 12:25:25,378 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:25:25,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:25,378 INFO L82 PathProgramCache]: Analyzing trace with hash -52836852, now seen corresponding path program 1 times [2018-11-28 12:25:25,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:25,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:25,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:25,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:25,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:25,474 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:25:25,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:25,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 12:25:25,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 12:25:25,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 12:25:25,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:25:25,475 INFO L87 Difference]: Start difference. First operand 132 states and 161 transitions. Second operand 13 states. [2018-11-28 12:25:25,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:25,700 INFO L93 Difference]: Finished difference Result 204 states and 255 transitions. [2018-11-28 12:25:25,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 12:25:25,700 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-11-28 12:25:25,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:25,701 INFO L225 Difference]: With dead ends: 204 [2018-11-28 12:25:25,701 INFO L226 Difference]: Without dead ends: 204 [2018-11-28 12:25:25,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2018-11-28 12:25:25,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-11-28 12:25:25,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 166. [2018-11-28 12:25:25,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-28 12:25:25,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 217 transitions. [2018-11-28 12:25:25,708 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 217 transitions. Word has length 45 [2018-11-28 12:25:25,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:25,708 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 217 transitions. [2018-11-28 12:25:25,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 12:25:25,708 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 217 transitions. [2018-11-28 12:25:25,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 12:25:25,709 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:25,709 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-11-28 12:25:25,709 INFO L423 AbstractCegarLoop]: === Iteration 15 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:25:25,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:25,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1637572900, now seen corresponding path program 1 times [2018-11-28 12:25:25,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:25,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:25,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:25,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:25,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:25,772 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 12:25:25,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:25,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:25:25,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:25:25,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:25:25,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:25:25,773 INFO L87 Difference]: Start difference. First operand 166 states and 217 transitions. Second operand 6 states. [2018-11-28 12:25:25,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:25,895 INFO L93 Difference]: Finished difference Result 167 states and 217 transitions. [2018-11-28 12:25:25,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:25:25,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-11-28 12:25:25,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:25,897 INFO L225 Difference]: With dead ends: 167 [2018-11-28 12:25:25,897 INFO L226 Difference]: Without dead ends: 167 [2018-11-28 12:25:25,897 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-11-28 12:25:25,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-28 12:25:25,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2018-11-28 12:25:25,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-28 12:25:25,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 217 transitions. [2018-11-28 12:25:25,905 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 217 transitions. Word has length 46 [2018-11-28 12:25:25,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:25,905 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 217 transitions. [2018-11-28 12:25:25,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:25:25,905 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 217 transitions. [2018-11-28 12:25:25,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 12:25:25,906 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:25,906 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-11-28 12:25:25,906 INFO L423 AbstractCegarLoop]: === Iteration 16 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:25:25,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:25,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1637572899, now seen corresponding path program 1 times [2018-11-28 12:25:25,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:25,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:25,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:25,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:25,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:26,110 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:25:26,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:26,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-28 12:25:26,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 12:25:26,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 12:25:26,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-11-28 12:25:26,111 INFO L87 Difference]: Start difference. First operand 166 states and 217 transitions. Second operand 15 states. [2018-11-28 12:25:26,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:26,513 INFO L93 Difference]: Finished difference Result 239 states and 303 transitions. [2018-11-28 12:25:26,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 12:25:26,514 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-11-28 12:25:26,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:26,515 INFO L225 Difference]: With dead ends: 239 [2018-11-28 12:25:26,515 INFO L226 Difference]: Without dead ends: 239 [2018-11-28 12:25:26,515 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-11-28 12:25:26,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-11-28 12:25:26,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 198. [2018-11-28 12:25:26,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-28 12:25:26,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 264 transitions. [2018-11-28 12:25:26,519 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 264 transitions. Word has length 46 [2018-11-28 12:25:26,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:26,519 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 264 transitions. [2018-11-28 12:25:26,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 12:25:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 264 transitions. [2018-11-28 12:25:26,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 12:25:26,520 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:26,520 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-11-28 12:25:26,520 INFO L423 AbstractCegarLoop]: === Iteration 17 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:25:26,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:26,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1637942281, now seen corresponding path program 1 times [2018-11-28 12:25:26,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:26,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:26,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:26,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:26,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:26,542 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 12:25:26,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:26,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:25:26,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:25:26,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:25:26,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:25:26,543 INFO L87 Difference]: Start difference. First operand 198 states and 264 transitions. Second operand 5 states. [2018-11-28 12:25:26,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:26,622 INFO L93 Difference]: Finished difference Result 197 states and 260 transitions. [2018-11-28 12:25:26,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:25:26,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-11-28 12:25:26,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:26,624 INFO L225 Difference]: With dead ends: 197 [2018-11-28 12:25:26,624 INFO L226 Difference]: Without dead ends: 197 [2018-11-28 12:25:26,625 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-11-28 12:25:26,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-28 12:25:26,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-11-28 12:25:26,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-28 12:25:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 260 transitions. [2018-11-28 12:25:26,629 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 260 transitions. Word has length 46 [2018-11-28 12:25:26,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:26,629 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 260 transitions. [2018-11-28 12:25:26,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:25:26,629 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 260 transitions. [2018-11-28 12:25:26,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 12:25:26,629 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:26,629 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-11-28 12:25:26,629 INFO L423 AbstractCegarLoop]: === Iteration 18 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:25:26,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:26,630 INFO L82 PathProgramCache]: Analyzing trace with hash 763396975, now seen corresponding path program 1 times [2018-11-28 12:25:26,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:26,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:26,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:26,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:26,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:26,810 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:25:26,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:26,810 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:25:26,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:26,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:26,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:25:26,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:26,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:26,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:25:27,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:27,104 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:27,105 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:27,105 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-11-28 12:25:27,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:27,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:27,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:8 [2018-11-28 12:25:27,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 16 treesize of output 12 [2018-11-28 12:25:27,190 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-11-28 12:25:27,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:27,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:27,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:27,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-11-28 12:25:27,196 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:27,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-28 12:25:27,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:27,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:27,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-11-28 12:25:27,221 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:25:27,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:27,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 32 [2018-11-28 12:25:27,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-28 12:25:27,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-28 12:25:27,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 12:25:27,236 INFO L87 Difference]: Start difference. First operand 197 states and 260 transitions. Second operand 33 states. [2018-11-28 12:25:30,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:30,659 INFO L93 Difference]: Finished difference Result 217 states and 281 transitions. [2018-11-28 12:25:30,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-28 12:25:30,660 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-11-28 12:25:30,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:30,662 INFO L225 Difference]: With dead ends: 217 [2018-11-28 12:25:30,662 INFO L226 Difference]: Without dead ends: 217 [2018-11-28 12:25:30,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=1615, Unknown=0, NotChecked=0, Total=1806 [2018-11-28 12:25:30,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-28 12:25:30,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 203. [2018-11-28 12:25:30,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-28 12:25:30,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 265 transitions. [2018-11-28 12:25:30,667 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 265 transitions. Word has length 47 [2018-11-28 12:25:30,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:30,668 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 265 transitions. [2018-11-28 12:25:30,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-28 12:25:30,668 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 265 transitions. [2018-11-28 12:25:30,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 12:25:30,668 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:30,668 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-11-28 12:25:30,669 INFO L423 AbstractCegarLoop]: === Iteration 19 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:25:30,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:30,669 INFO L82 PathProgramCache]: Analyzing trace with hash -578653648, now seen corresponding path program 2 times [2018-11-28 12:25:30,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:30,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:30,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:30,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:30,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:30,721 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-28 12:25:30,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:30,723 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:25:30,734 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:25:30,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:25:30,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:25:30,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:30,784 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-28 12:25:30,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:30,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 12:25:30,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:25:30,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:25:30,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:25:30,800 INFO L87 Difference]: Start difference. First operand 203 states and 265 transitions. Second operand 6 states. [2018-11-28 12:25:30,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:30,828 INFO L93 Difference]: Finished difference Result 126 states and 145 transitions. [2018-11-28 12:25:30,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:25:30,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-11-28 12:25:30,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:30,829 INFO L225 Difference]: With dead ends: 126 [2018-11-28 12:25:30,829 INFO L226 Difference]: Without dead ends: 117 [2018-11-28 12:25:30,830 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-11-28 12:25:30,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-28 12:25:30,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-11-28 12:25:30,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-28 12:25:30,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 134 transitions. [2018-11-28 12:25:30,833 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 134 transitions. Word has length 51 [2018-11-28 12:25:30,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:30,833 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 134 transitions. [2018-11-28 12:25:30,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:25:30,833 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions. [2018-11-28 12:25:30,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 12:25:30,834 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:30,834 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-11-28 12:25:30,834 INFO L423 AbstractCegarLoop]: === Iteration 20 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:25:30,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:30,834 INFO L82 PathProgramCache]: Analyzing trace with hash -633588376, now seen corresponding path program 1 times [2018-11-28 12:25:30,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:30,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:30,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:30,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:25:30,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:31,075 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 12:25:31,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:31,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 12:25:31,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 12:25:31,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 12:25:31,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:25:31,076 INFO L87 Difference]: Start difference. First operand 117 states and 134 transitions. Second operand 11 states. [2018-11-28 12:25:31,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:31,276 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2018-11-28 12:25:31,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:25:31,276 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-11-28 12:25:31,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:31,277 INFO L225 Difference]: With dead ends: 116 [2018-11-28 12:25:31,277 INFO L226 Difference]: Without dead ends: 116 [2018-11-28 12:25:31,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-11-28 12:25:31,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-28 12:25:31,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-11-28 12:25:31,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-28 12:25:31,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2018-11-28 12:25:31,279 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 51 [2018-11-28 12:25:31,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:31,280 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2018-11-28 12:25:31,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 12:25:31,280 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2018-11-28 12:25:31,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 12:25:31,280 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:31,280 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-11-28 12:25:31,281 INFO L423 AbstractCegarLoop]: === Iteration 21 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:25:31,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:31,281 INFO L82 PathProgramCache]: Analyzing trace with hash -633535761, now seen corresponding path program 1 times [2018-11-28 12:25:31,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:31,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:31,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:31,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:31,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:31,550 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:31,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:31,550 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:25:31,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:31,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:31,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:31,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:31,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 12:25:31,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:31,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:31,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-28 12:25:31,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:25:31,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11-28 12:25:31,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:31,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:31,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:31,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-11-28 12:25:31,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11-28 12:25:31,684 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-11-28 12:25:31,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:31,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:31,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:31,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-11-28 12:25:31,908 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-11-28 12:25:31,910 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-11-28 12:25:31,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:31,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:31,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:31,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:56 [2018-11-28 12:25:32,020 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-11-28 12:25:32,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-11-28 12:25:32,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:32,045 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-11-28 12:25:32,045 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:32,065 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-11-28 12:25:32,065 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:32,084 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-11-28 12:25:32,085 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:32,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11-28 12:25:32,103 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:32,125 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-11-28 12:25:32,126 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:32,145 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-11-28 12:25:32,146 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:32,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, 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-11-28 12:25:32,159 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:32,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:32,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:32,163 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:60, output treesize:5 [2018-11-28 12:25:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:32,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:32,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 33 [2018-11-28 12:25:32,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-28 12:25:32,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-28 12:25:32,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 12:25:32,196 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand 34 states. [2018-11-28 12:25:33,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:33,204 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2018-11-28 12:25:33,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-28 12:25:33,204 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2018-11-28 12:25:33,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:33,205 INFO L225 Difference]: With dead ends: 125 [2018-11-28 12:25:33,205 INFO L226 Difference]: Without dead ends: 125 [2018-11-28 12:25:33,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=212, Invalid=2238, Unknown=0, NotChecked=0, Total=2450 [2018-11-28 12:25:33,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-28 12:25:33,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 114. [2018-11-28 12:25:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-28 12:25:33,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2018-11-28 12:25:33,208 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 51 [2018-11-28 12:25:33,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:33,208 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2018-11-28 12:25:33,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-28 12:25:33,208 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2018-11-28 12:25:33,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 12:25:33,209 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:33,209 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-11-28 12:25:33,209 INFO L423 AbstractCegarLoop]: === Iteration 22 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:25:33,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:33,209 INFO L82 PathProgramCache]: Analyzing trace with hash -633535760, now seen corresponding path program 1 times [2018-11-28 12:25:33,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:33,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:33,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:33,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:33,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:33,634 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:33,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:33,634 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:25:33,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:33,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:33,907 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:33,908 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:33,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 12:25:33,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:33,921 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-11-28 12:25:33,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:33,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:33,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:32 [2018-11-28 12:25:34,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:25:34,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:25:34,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:34,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:34,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:25:34,016 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-11-28 12:25:34,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:34,018 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:34,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:34,027 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:48 [2018-11-28 12:25:34,119 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-11-28 12:25:34,121 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-11-28 12:25:34,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:34,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:34,140 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-11-28 12:25:34,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 12 treesize of output 11 [2018-11-28 12:25:34,141 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:34,147 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:34,157 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-11-28 12:25:34,157 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:71 [2018-11-28 12:25:34,932 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:34,934 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:34,937 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-11-28 12:25:34,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, 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-11-28 12:25:34,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:34,968 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-11-28 12:25:34,969 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:34,993 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-11-28 12:25:34,994 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:35,020 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-11-28 12:25:35,021 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:35,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, 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-11-28 12:25:35,042 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:35,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 12:25:35,103 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-11-28 12:25:35,105 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-11-28 12:25:35,105 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:35,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-28 12:25:35,118 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:35,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 12:25:35,133 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:35,140 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:35,147 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-11-28 12:25:35,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 67 treesize of output 60 [2018-11-28 12:25:35,151 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:35,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 60 treesize of output 48 [2018-11-28 12:25:35,180 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:35,208 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-11-28 12:25:35,209 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:35,235 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-11-28 12:25:35,236 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:35,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 44 treesize of output 33 [2018-11-28 12:25:35,260 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:35,283 INFO L267 ElimStorePlain]: Start of recursive call 12: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:25:35,304 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-11-28 12:25:35,305 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 4 variables, input treesize:181, output treesize:47 [2018-11-28 12:25:35,438 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:35,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:35,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 29] total 51 [2018-11-28 12:25:35,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-28 12:25:35,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-28 12:25:35,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=2523, Unknown=0, NotChecked=0, Total=2652 [2018-11-28 12:25:35,454 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand 52 states. [2018-11-28 12:25:37,740 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 86 [2018-11-28 12:25:38,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:38,463 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2018-11-28 12:25:38,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 12:25:38,464 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-11-28 12:25:38,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:38,465 INFO L225 Difference]: With dead ends: 138 [2018-11-28 12:25:38,465 INFO L226 Difference]: Without dead ends: 138 [2018-11-28 12:25:38,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=333, Invalid=5069, Unknown=0, NotChecked=0, Total=5402 [2018-11-28 12:25:38,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-28 12:25:38,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 124. [2018-11-28 12:25:38,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-28 12:25:38,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 141 transitions. [2018-11-28 12:25:38,469 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 141 transitions. Word has length 51 [2018-11-28 12:25:38,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:38,470 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 141 transitions. [2018-11-28 12:25:38,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-28 12:25:38,470 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 141 transitions. [2018-11-28 12:25:38,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 12:25:38,470 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:38,470 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-11-28 12:25:38,475 INFO L423 AbstractCegarLoop]: === Iteration 23 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:25:38,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:38,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1855099592, now seen corresponding path program 1 times [2018-11-28 12:25:38,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:38,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:38,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:38,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:38,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:38,505 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 12:25:38,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:38,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:25:38,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:25:38,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:25:38,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:25:38,506 INFO L87 Difference]: Start difference. First operand 124 states and 141 transitions. Second operand 5 states. [2018-11-28 12:25:38,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:38,561 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2018-11-28 12:25:38,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:25:38,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-28 12:25:38,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:38,562 INFO L225 Difference]: With dead ends: 122 [2018-11-28 12:25:38,563 INFO L226 Difference]: Without dead ends: 122 [2018-11-28 12:25:38,563 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-11-28 12:25:38,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-28 12:25:38,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-11-28 12:25:38,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-28 12:25:38,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-11-28 12:25:38,566 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 52 [2018-11-28 12:25:38,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:38,566 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-11-28 12:25:38,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:25:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-11-28 12:25:38,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 12:25:38,567 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:38,567 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-11-28 12:25:38,567 INFO L423 AbstractCegarLoop]: === Iteration 24 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:25:38,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:38,567 INFO L82 PathProgramCache]: Analyzing trace with hash -339279462, now seen corresponding path program 1 times [2018-11-28 12:25:38,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:38,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:38,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:38,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:38,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:38,591 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 12:25:38,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:38,591 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:25:38,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:38,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:38,650 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 12:25:38,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:38,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-28 12:25:38,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:25:38,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:25:38,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:25:38,666 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 7 states. [2018-11-28 12:25:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:38,698 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2018-11-28 12:25:38,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:25:38,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-11-28 12:25:38,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:38,700 INFO L225 Difference]: With dead ends: 130 [2018-11-28 12:25:38,700 INFO L226 Difference]: Without dead ends: 130 [2018-11-28 12:25:38,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:25:38,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-28 12:25:38,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2018-11-28 12:25:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-28 12:25:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2018-11-28 12:25:38,702 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 54 [2018-11-28 12:25:38,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:38,702 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2018-11-28 12:25:38,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:25:38,702 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2018-11-28 12:25:38,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 12:25:38,702 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:38,703 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-11-28 12:25:38,703 INFO L423 AbstractCegarLoop]: === Iteration 25 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:25:38,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:38,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1922483537, now seen corresponding path program 1 times [2018-11-28 12:25:38,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:38,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:38,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:38,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:38,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:39,323 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:39,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:39,323 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:25:39,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:39,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:39,510 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:39,510 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:39,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 12:25:39,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:39,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:39,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-11-28 12:25:39,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-11-28 12:25:39,546 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-11-28 12:25:39,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:39,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:39,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:39,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-11-28 12:25:39,595 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-11-28 12:25:39,596 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-11-28 12:25:39,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:39,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:39,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:39,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-11-28 12:25:39,937 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-11-28 12:25:39,938 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-11-28 12:25:39,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:39,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:39,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:39,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:15 [2018-11-28 12:25:39,994 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:40,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:40,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 28] total 58 [2018-11-28 12:25:40,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-28 12:25:40,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-28 12:25:40,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=3104, Unknown=0, NotChecked=0, Total=3306 [2018-11-28 12:25:40,010 INFO L87 Difference]: Start difference. First operand 126 states and 142 transitions. Second operand 58 states. [2018-11-28 12:25:41,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:41,455 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2018-11-28 12:25:41,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-28 12:25:41,455 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 55 [2018-11-28 12:25:41,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:41,456 INFO L225 Difference]: With dead ends: 109 [2018-11-28 12:25:41,456 INFO L226 Difference]: Without dead ends: 103 [2018-11-28 12:25:41,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1792 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=563, Invalid=7093, Unknown=0, NotChecked=0, Total=7656 [2018-11-28 12:25:41,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-28 12:25:41,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-11-28 12:25:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-28 12:25:41,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2018-11-28 12:25:41,460 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 55 [2018-11-28 12:25:41,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:41,460 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2018-11-28 12:25:41,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-28 12:25:41,460 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2018-11-28 12:25:41,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 12:25:41,461 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:41,461 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-11-28 12:25:41,461 INFO L423 AbstractCegarLoop]: === Iteration 26 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:25:41,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:41,461 INFO L82 PathProgramCache]: Analyzing trace with hash 175007029, now seen corresponding path program 1 times [2018-11-28 12:25:41,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:41,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:41,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:41,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:41,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:41,933 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:25:41,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:41,933 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:25:41,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:41,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:41,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:25:41,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:42,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:42,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:25:42,246 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:42,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:42,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 12:25:42,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:42,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:42,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-11-28 12:25:42,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:25:42,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, 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-11-28 12:25:42,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:42,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:42,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:42,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-28 12:25:42,364 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-11-28 12:25:42,367 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-11-28 12:25:42,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:42,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:42,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:42,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-11-28 12:25:42,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:42,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:42,436 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-11-28 12:25:42,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:42,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:42,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:37 [2018-11-28 12:25:42,677 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:25:42,678 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:42,680 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:42,682 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-11-28 12:25:42,683 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:25:42,688 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-11-28 12:25:42,689 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 12:25:42,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-28 12:25:42,712 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:42,717 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-11-28 12:25:42,717 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:42,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:42,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:42,723 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:92, output treesize:22 [2018-11-28 12:25:42,786 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-11-28 12:25:42,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:25:42,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:42,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:42,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:42,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:18 [2018-11-28 12:25:42,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 12:25:42,805 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-11-28 12:25:42,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:42,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:42,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:42,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-28 12:25:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:25:42,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:42,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 45 [2018-11-28 12:25:42,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-28 12:25:42,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-28 12:25:42,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1932, Unknown=0, NotChecked=0, Total=2070 [2018-11-28 12:25:42,831 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand 46 states. [2018-11-28 12:25:44,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:44,113 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2018-11-28 12:25:44,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-28 12:25:44,113 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 56 [2018-11-28 12:25:44,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:44,114 INFO L225 Difference]: With dead ends: 116 [2018-11-28 12:25:44,114 INFO L226 Difference]: Without dead ends: 116 [2018-11-28 12:25:44,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=339, Invalid=3821, Unknown=0, NotChecked=0, Total=4160 [2018-11-28 12:25:44,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-28 12:25:44,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2018-11-28 12:25:44,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-28 12:25:44,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-11-28 12:25:44,116 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 56 [2018-11-28 12:25:44,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:44,116 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-11-28 12:25:44,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-28 12:25:44,117 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-11-28 12:25:44,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 12:25:44,117 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:44,117 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-11-28 12:25:44,117 INFO L423 AbstractCegarLoop]: === Iteration 27 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:25:44,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:44,117 INFO L82 PathProgramCache]: Analyzing trace with hash 175059644, now seen corresponding path program 2 times [2018-11-28 12:25:44,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:44,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:44,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:44,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:44,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:44,506 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:44,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:44,506 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:25:44,513 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:25:44,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:25:44,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:25:44,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:44,768 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:44,769 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:44,769 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-11-28 12:25:44,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:44,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:44,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:33 [2018-11-28 12:25:44,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:25:44,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:25:44,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:44,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:44,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:25:44,861 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-11-28 12:25:44,861 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:44,862 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:44,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:44,870 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-11-28 12:25:44,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:44,947 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-11-28 12:25:44,949 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-11-28 12:25:44,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:44,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:44,968 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-11-28 12:25:44,969 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-11-28 12:25:44,969 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:44,974 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:44,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:44,984 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:89, output treesize:73 [2018-11-28 12:25:45,573 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:45,578 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-11-28 12:25:45,581 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:25:45,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11-28 12:25:45,582 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:45,610 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-11-28 12:25:45,610 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:45,631 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-11-28 12:25:45,631 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:45,650 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-11-28 12:25:45,651 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:45,671 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-11-28 12:25:45,671 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:45,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 12:25:45,708 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-11-28 12:25:45,708 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:191, output treesize:164 [2018-11-28 12:25:45,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:45,824 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:45,825 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:45,828 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-11-28 12:25:45,847 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-11-28 12:25:45,851 INFO L267 ElimStorePlain]: Start of recursive call 3: 17 dim-0 vars, End of recursive call: 17 dim-0 vars, and 7 xjuncts. [2018-11-28 12:25:45,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11-28 12:25:45,945 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 12:25:45,947 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:45,948 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-11-28 12:25:45,948 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:45,953 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-11-28 12:25:45,953 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-28 12:25:45,958 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-11-28 12:25:45,959 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 12:25:45,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 47 treesize of output 40 [2018-11-28 12:25:45,963 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:45,969 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-11-28 12:25:45,970 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-28 12:25:45,971 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-11-28 12:25:45,971 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:46,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11-28 12:25:46,060 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-28 12:25:46,065 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-11-28 12:25:46,065 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-28 12:25:46,066 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-11-28 12:25:46,067 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:46,068 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:46,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11-28 12:25:46,070 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:46,076 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-11-28 12:25:46,077 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-28 12:25:46,078 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-11-28 12:25:46,078 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:46,082 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-11-28 12:25:46,083 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-28 12:25:46,145 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-11-28 12:25:46,146 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:46,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, 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-11-28 12:25:46,189 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:46,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-11-28 12:25:46,280 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-11-28 12:25:46,280 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 3 variables, input treesize:79, output treesize:121 [2018-11-28 12:25:46,394 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:46,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:46,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30] total 54 [2018-11-28 12:25:46,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-28 12:25:46,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-28 12:25:46,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2792, Unknown=0, NotChecked=0, Total=2970 [2018-11-28 12:25:46,410 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 55 states. [2018-11-28 12:25:47,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:47,938 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2018-11-28 12:25:47,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-28 12:25:47,939 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 56 [2018-11-28 12:25:47,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:47,939 INFO L225 Difference]: With dead ends: 121 [2018-11-28 12:25:47,939 INFO L226 Difference]: Without dead ends: 121 [2018-11-28 12:25:47,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=379, Invalid=4733, Unknown=0, NotChecked=0, Total=5112 [2018-11-28 12:25:47,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-28 12:25:47,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 105. [2018-11-28 12:25:47,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-28 12:25:47,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2018-11-28 12:25:47,946 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 56 [2018-11-28 12:25:47,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:47,946 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2018-11-28 12:25:47,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-28 12:25:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2018-11-28 12:25:47,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 12:25:47,947 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:47,947 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-11-28 12:25:47,947 INFO L423 AbstractCegarLoop]: === Iteration 28 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:25:47,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:47,948 INFO L82 PathProgramCache]: Analyzing trace with hash 175059645, now seen corresponding path program 2 times [2018-11-28 12:25:47,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:47,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:47,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:47,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:25:47,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:48,367 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:48,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:48,367 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:25:48,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:25:48,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:25:48,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:25:48,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:48,600 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:48,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:48,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 12:25:48,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:48,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:48,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-11-28 12:25:48,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:25:48,674 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-11-28 12:25:48,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:48,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:48,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:25:48,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:25:48,685 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:48,687 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:48,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:48,693 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-11-28 12:25:48,762 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:48,762 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-11-28 12:25:48,764 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-11-28 12:25:48,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:48,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:48,779 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-11-28 12:25:48,781 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-11-28 12:25:48,781 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:48,786 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:48,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:48,793 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:59 [2018-11-28 12:25:49,415 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:49,417 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:49,417 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:49,421 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-11-28 12:25:49,429 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-11-28 12:25:49,430 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-28 12:25:49,472 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-11-28 12:25:49,473 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:49,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 12:25:49,508 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:49,541 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-11-28 12:25:49,541 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:49,575 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:25:49,579 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-11-28 12:25:49,580 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 12:25:49,582 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:25:49,582 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-11-28 12:25:49,582 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:49,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-28 12:25:49,651 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-11-28 12:25:49,653 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-11-28 12:25:49,654 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:49,673 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-11-28 12:25:49,674 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:49,691 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-11-28 12:25:49,691 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:49,713 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-11-28 12:25:49,713 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:49,732 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-11-28 12:25:49,732 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:49,742 INFO L267 ElimStorePlain]: Start of recursive call 9: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:49,747 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-11-28 12:25:49,749 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-11-28 12:25:49,749 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:49,769 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-11-28 12:25:49,769 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:49,787 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-11-28 12:25:49,787 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:49,803 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-11-28 12:25:49,804 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:49,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 32 treesize of output 21 [2018-11-28 12:25:49,819 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:49,829 INFO L267 ElimStorePlain]: Start of recursive call 15: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:49,832 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-11-28 12:25:49,834 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-11-28 12:25:49,834 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:49,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-28 12:25:49,844 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:49,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 12:25:49,854 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:49,859 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:49,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:49,878 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 3 variables, input treesize:211, output treesize:13 [2018-11-28 12:25:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:49,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:49,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30] total 53 [2018-11-28 12:25:49,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-28 12:25:49,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-28 12:25:49,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2602, Unknown=0, NotChecked=0, Total=2756 [2018-11-28 12:25:49,936 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 53 states. [2018-11-28 12:25:51,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:51,366 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-11-28 12:25:51,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-28 12:25:51,366 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 56 [2018-11-28 12:25:51,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:51,366 INFO L225 Difference]: With dead ends: 102 [2018-11-28 12:25:51,367 INFO L226 Difference]: Without dead ends: 102 [2018-11-28 12:25:51,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=324, Invalid=4368, Unknown=0, NotChecked=0, Total=4692 [2018-11-28 12:25:51,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-28 12:25:51,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-11-28 12:25:51,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-28 12:25:51,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-11-28 12:25:51,369 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 56 [2018-11-28 12:25:51,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:51,369 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-11-28 12:25:51,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-28 12:25:51,369 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-11-28 12:25:51,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 12:25:51,370 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:51,370 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-11-28 12:25:51,370 INFO L423 AbstractCegarLoop]: === Iteration 29 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:25:51,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:51,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1130250775, now seen corresponding path program 1 times [2018-11-28 12:25:51,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:51,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:51,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:51,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:25:51,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:51,812 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 12:25:51,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:51,812 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:25:51,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:51,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:51,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:25:51,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:51,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:51,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:25:51,904 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:51,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:51,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 12:25:51,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:51,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:51,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-11-28 12:25:51,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:25:51,955 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-11-28 12:25:51,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:51,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:51,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:51,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-28 12:25:52,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-11-28 12:25:52,012 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-11-28 12:25:52,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:52,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:52,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:52,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-11-28 12:25:52,079 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:52,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:52,080 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-11-28 12:25:52,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:52,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:52,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:36 [2018-11-28 12:25:52,247 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-11-28 12:25:52,249 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-11-28 12:25:52,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:52,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:52,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:52,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:67 [2018-11-28 12:25:52,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:52,431 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:25:52,433 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:25:52,447 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-11-28 12:25:52,456 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-11-28 12:25:52,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 12:25:52,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:25:52,487 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-11-28 12:25:52,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:87, output treesize:102 [2018-11-28 12:25:52,544 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-11-28 12:25:52,545 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-11-28 12:25:52,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:52,554 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-11-28 12:25:52,554 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:52,563 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-11-28 12:25:52,564 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 12:25:52,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:25:52,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:52,574 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:5 [2018-11-28 12:25:52,597 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 12:25:52,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:52,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 42 [2018-11-28 12:25:52,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-28 12:25:52,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-28 12:25:52,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1687, Unknown=0, NotChecked=0, Total=1806 [2018-11-28 12:25:52,613 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 43 states. [2018-11-28 12:25:53,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:53,662 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2018-11-28 12:25:53,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-28 12:25:53,662 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 57 [2018-11-28 12:25:53,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:53,663 INFO L225 Difference]: With dead ends: 100 [2018-11-28 12:25:53,663 INFO L226 Difference]: Without dead ends: 100 [2018-11-28 12:25:53,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=262, Invalid=3044, Unknown=0, NotChecked=0, Total=3306 [2018-11-28 12:25:53,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-28 12:25:53,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-11-28 12:25:53,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-28 12:25:53,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2018-11-28 12:25:53,666 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 57 [2018-11-28 12:25:53,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:53,666 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2018-11-28 12:25:53,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-28 12:25:53,666 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2018-11-28 12:25:53,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 12:25:53,667 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:53,667 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-11-28 12:25:53,667 INFO L423 AbstractCegarLoop]: === Iteration 30 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:25:53,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:53,667 INFO L82 PathProgramCache]: Analyzing trace with hash 678035832, now seen corresponding path program 1 times [2018-11-28 12:25:53,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:53,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:53,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:53,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:53,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:54,484 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:25:54,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:54,484 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:25:54,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:54,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:54,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:25:54,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:54,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:54,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:25:54,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:25:54,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:25:54,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:54,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:54,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:54,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-28 12:25:54,857 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:54,859 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-11-28 12:25:54,861 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-11-28 12:25:54,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:54,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:54,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:54,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-11-28 12:25:54,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:54,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:54,966 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:54,967 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-11-28 12:25:54,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:54,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:54,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:35 [2018-11-28 12:25:55,328 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-11-28 12:25:55,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11-28 12:25:55,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:55,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:55,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:55,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:71 [2018-11-28 12:25:55,579 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:25:55,591 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:55,592 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:55,593 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:25:55,602 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-11-28 12:25:55,610 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-11-28 12:25:55,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 12:25:55,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:25:55,638 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-11-28 12:25:55,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:91, output treesize:110 [2018-11-28 12:25:55,715 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-11-28 12:25:55,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, 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-11-28 12:25:55,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:55,720 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-11-28 12:25:55,720 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:55,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:55,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:55,723 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:49, output treesize:10 [2018-11-28 12:25:55,725 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:55,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-28 12:25:55,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:55,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:55,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-11-28 12:25:55,781 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:25:55,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:55,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 27] total 56 [2018-11-28 12:25:55,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-28 12:25:55,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-28 12:25:55,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3017, Unknown=0, NotChecked=0, Total=3192 [2018-11-28 12:25:55,797 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 57 states. [2018-11-28 12:26:00,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:00,442 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-11-28 12:26:00,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-28 12:26:00,442 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 58 [2018-11-28 12:26:00,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:00,443 INFO L225 Difference]: With dead ends: 100 [2018-11-28 12:26:00,443 INFO L226 Difference]: Without dead ends: 100 [2018-11-28 12:26:00,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=493, Invalid=6647, Unknown=0, NotChecked=0, Total=7140 [2018-11-28 12:26:00,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-28 12:26:00,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-11-28 12:26:00,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-28 12:26:00,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-11-28 12:26:00,446 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 58 [2018-11-28 12:26:00,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:00,446 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-11-28 12:26:00,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-28 12:26:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-11-28 12:26:00,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 12:26:00,447 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:00,447 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-11-28 12:26:00,447 INFO L423 AbstractCegarLoop]: === Iteration 31 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:26:00,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:00,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1952227256, now seen corresponding path program 1 times [2018-11-28 12:26:00,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:00,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:00,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:00,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:00,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:01,550 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:26:01,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:26:01,550 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:26:01,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:01,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:26:01,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:26:01,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:26:01,690 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:01,690 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:01,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 12:26:01,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-11-28 12:26:01,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:26:01,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:26:01,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:26:01,767 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-11-28 12:26:01,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,769 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,773 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-11-28 12:26:01,845 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-11-28 12:26:01,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 12:26:01,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,861 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-11-28 12:26:01,863 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-11-28 12:26:01,863 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,867 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,873 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-11-28 12:26:01,873 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:50 [2018-11-28 12:26:01,963 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:01,963 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:01,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, 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-11-28 12:26:01,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:01,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:52 [2018-11-28 12:26:04,517 WARN L180 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 36 [2018-11-28 12:26:05,709 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 45 [2018-11-28 12:26:05,714 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:05,720 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-11-28 12:26:05,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-28 12:26:05,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:05,767 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-11-28 12:26:05,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 12:26:05,817 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-11-28 12:26:05,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:197, output treesize:385 [2018-11-28 12:26:08,395 WARN L180 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2018-11-28 12:26:10,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,623 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,624 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:26:10,626 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,634 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-11-28 12:26:10,641 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-11-28 12:26:10,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 12:26:10,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,665 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,666 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,667 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,668 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,671 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-11-28 12:26:10,682 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-11-28 12:26:10,684 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-28 12:26:10,728 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-28 12:26:10,730 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,731 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,731 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,733 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,734 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,737 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-11-28 12:26:10,750 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-11-28 12:26:10,752 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-28 12:26:10,797 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-28 12:26:10,880 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-11-28 12:26:10,963 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,964 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,966 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-11-28 12:26:10,968 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-11-28 12:26:10,968 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,981 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-11-28 12:26:10,981 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,989 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,990 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,994 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-11-28 12:26:10,996 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-11-28 12:26:10,996 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,007 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-11-28 12:26:11,007 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,014 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,016 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:11,017 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:11,017 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:11,020 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-11-28 12:26:11,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 58 [2018-11-28 12:26:11,022 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,034 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-11-28 12:26:11,035 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,042 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,043 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:11,044 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:11,046 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-11-28 12:26:11,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 5 treesize of output 1 [2018-11-28 12:26:11,048 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,058 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-11-28 12:26:11,059 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,066 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,067 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:11,068 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:11,069 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:11,071 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-11-28 12:26:11,073 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-11-28 12:26:11,073 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,085 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-11-28 12:26:11,085 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,092 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,094 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:11,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:11,097 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-11-28 12:26:11,099 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-11-28 12:26:11,099 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,111 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-11-28 12:26:11,111 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,126 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,184 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-11-28 12:26:11,184 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 12 variables, input treesize:928, output treesize:466 [2018-11-28 12:26:11,463 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:11,465 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-11-28 12:26:11,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 12:26:11,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-28 12:26:11,473 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,477 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-11-28 12:26:11,477 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:11,483 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-11-28 12:26:11,483 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:11 [2018-11-28 12:26:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:26:11,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:26:11,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 66 [2018-11-28 12:26:11,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-11-28 12:26:11,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-11-28 12:26:11,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=4209, Unknown=2, NotChecked=0, Total=4422 [2018-11-28 12:26:11,561 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 67 states. [2018-11-28 12:26:18,792 WARN L180 SmtUtils]: Spent 3.51 s on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-11-28 12:26:20,513 WARN L180 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-11-28 12:26:32,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:32,307 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2018-11-28 12:26:32,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-28 12:26:32,307 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2018-11-28 12:26:32,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:32,308 INFO L225 Difference]: With dead ends: 163 [2018-11-28 12:26:32,308 INFO L226 Difference]: Without dead ends: 163 [2018-11-28 12:26:32,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2889 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=908, Invalid=11296, Unknown=6, NotChecked=0, Total=12210 [2018-11-28 12:26:32,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-28 12:26:32,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 113. [2018-11-28 12:26:32,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-28 12:26:32,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2018-11-28 12:26:32,311 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 66 [2018-11-28 12:26:32,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:32,311 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2018-11-28 12:26:32,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-11-28 12:26:32,311 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2018-11-28 12:26:32,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 12:26:32,311 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:32,312 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-11-28 12:26:32,312 INFO L423 AbstractCegarLoop]: === Iteration 32 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:26:32,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:32,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1952227257, now seen corresponding path program 1 times [2018-11-28 12:26:32,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:32,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:32,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:32,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:32,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:33,074 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:33,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:26:33,074 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:26:33,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:33,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:26:33,352 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-11-28 12:26:33,355 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-11-28 12:26:33,355 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:33,369 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-11-28 12:26:33,370 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:33,385 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-11-28 12:26:33,386 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 12:26:33,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 12:26:33,423 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-11-28 12:26:33,425 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-11-28 12:26:33,425 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:33,436 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-11-28 12:26:33,436 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:33,446 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-11-28 12:26:33,446 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:33,451 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:33,455 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-11-28 12:26:33,456 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-11-28 12:26:33,456 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:33,461 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-11-28 12:26:33,462 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:33,465 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:33,470 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-11-28 12:26:33,472 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-11-28 12:26:33,472 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:33,481 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-11-28 12:26:33,481 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:33,492 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-11-28 12:26:33,492 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:33,498 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:33,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:33,506 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 2 variables, input treesize:67, output treesize:13 [2018-11-28 12:26:33,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:26:33,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:26:33,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:33,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:33,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:26:33,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:26:33,624 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:33,627 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:33,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:33,634 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:23 [2018-11-28 12:26:33,821 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-11-28 12:26:33,822 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-11-28 12:26:33,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:33,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:33,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-11-28 12:26:33,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-11-28 12:26:33,829 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:33,831 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:33,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:33,834 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2018-11-28 12:26:33,868 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 12:26:33,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:26:33,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 16] total 48 [2018-11-28 12:26:33,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-28 12:26:33,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-28 12:26:33,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2204, Unknown=0, NotChecked=0, Total=2352 [2018-11-28 12:26:33,883 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 49 states. [2018-11-28 12:26:38,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:38,421 INFO L93 Difference]: Finished difference Result 218 states and 233 transitions. [2018-11-28 12:26:38,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-11-28 12:26:38,422 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 66 [2018-11-28 12:26:38,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:38,422 INFO L225 Difference]: With dead ends: 218 [2018-11-28 12:26:38,422 INFO L226 Difference]: Without dead ends: 218 [2018-11-28 12:26:38,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2525 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1052, Invalid=10504, Unknown=0, NotChecked=0, Total=11556 [2018-11-28 12:26:38,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-11-28 12:26:38,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 152. [2018-11-28 12:26:38,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-28 12:26:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 177 transitions. [2018-11-28 12:26:38,426 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 177 transitions. Word has length 66 [2018-11-28 12:26:38,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:38,426 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 177 transitions. [2018-11-28 12:26:38,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-28 12:26:38,426 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 177 transitions. [2018-11-28 12:26:38,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 12:26:38,427 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:38,427 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-11-28 12:26:38,427 INFO L423 AbstractCegarLoop]: === Iteration 33 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:26:38,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:38,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1962381513, now seen corresponding path program 1 times [2018-11-28 12:26:38,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:38,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:38,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:38,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:38,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:26:38,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:26:38,774 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:26:38,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:38,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:26:38,930 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:38,930 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:38,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 12:26:38,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:38,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:38,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-11-28 12:26:38,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:26:38,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:26:38,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:38,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:38,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:38,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-28 12:26:39,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 12:26:39,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:26:39,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:39,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:39,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:39,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2018-11-28 12:26:39,320 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-11-28 12:26:39,322 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-11-28 12:26:39,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:39,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:39,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:39,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-28 12:26:39,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-11-28 12:26:39,329 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-11-28 12:26:39,329 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:39,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:39,348 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-11-28 12:26:39,351 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-11-28 12:26:39,351 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:39,380 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-11-28 12:26:39,380 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:39,403 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-11-28 12:26:39,404 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:39,425 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:26:39,427 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-11-28 12:26:39,427 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:39,437 INFO L267 ElimStorePlain]: Start of recursive call 4: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:39,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:39,440 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:71, output treesize:11 [2018-11-28 12:26:39,511 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-11-28 12:26:39,513 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-11-28 12:26:39,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:39,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:39,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:39,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-28 12:26:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:26:39,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:26:39,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 47 [2018-11-28 12:26:39,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-28 12:26:39,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-28 12:26:39,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2123, Unknown=0, NotChecked=0, Total=2256 [2018-11-28 12:26:39,552 INFO L87 Difference]: Start difference. First operand 152 states and 177 transitions. Second operand 48 states. [2018-11-28 12:26:41,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:41,156 INFO L93 Difference]: Finished difference Result 187 states and 215 transitions. [2018-11-28 12:26:41,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-28 12:26:41,156 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 71 [2018-11-28 12:26:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:41,157 INFO L225 Difference]: With dead ends: 187 [2018-11-28 12:26:41,157 INFO L226 Difference]: Without dead ends: 187 [2018-11-28 12:26:41,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1399 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=528, Invalid=5952, Unknown=0, NotChecked=0, Total=6480 [2018-11-28 12:26:41,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-28 12:26:41,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 161. [2018-11-28 12:26:41,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-28 12:26:41,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2018-11-28 12:26:41,161 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 71 [2018-11-28 12:26:41,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:41,162 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2018-11-28 12:26:41,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-28 12:26:41,162 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2018-11-28 12:26:41,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-28 12:26:41,162 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:41,162 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-11-28 12:26:41,163 INFO L423 AbstractCegarLoop]: === Iteration 34 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:26:41,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:41,163 INFO L82 PathProgramCache]: Analyzing trace with hash 357995244, now seen corresponding path program 1 times [2018-11-28 12:26:41,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:41,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:41,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:41,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:41,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:41,510 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 12:26:41,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:26:41,511 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:26:41,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:41,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:26:41,617 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-11-28 12:26:41,620 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-11-28 12:26:41,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:41,636 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-11-28 12:26:41,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 12:26:41,651 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-11-28 12:26:41,652 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:41,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 12:26:41,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 12:26:41,678 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:67, output treesize:109 [2018-11-28 12:26:41,808 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-11-28 12:26:41,811 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:41,865 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-11-28 12:26:41,865 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:41,898 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-11-28 12:26:41,898 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 12:26:41,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 12:26:42,036 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-11-28 12:26:42,039 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:42,091 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-11-28 12:26:42,091 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:42,116 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-11-28 12:26:42,117 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 12:26:42,160 INFO L267 ElimStorePlain]: Start of recursive call 6: 5 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 12:26:42,228 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-11-28 12:26:42,235 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-11-28 12:26:42,235 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 12:26:42,285 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-11-28 12:26:42,285 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:42,326 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-11-28 12:26:42,408 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-11-28 12:26:42,408 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:148, output treesize:335 [2018-11-28 12:26:42,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 12:26:42,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:42,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:42,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:34 [2018-11-28 12:26:42,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:26:42,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:26:42,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:42,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:42,621 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-11-28 12:26:42,625 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-11-28 12:26:42,625 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:42,702 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-11-28 12:26:42,702 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:42,781 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-11-28 12:26:42,781 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:42,846 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:42,907 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:42,966 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:43,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 12:26:43,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-11-28 12:26:43,083 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:43,197 INFO L267 ElimStorePlain]: Start of recursive call 4: 9 dim-1 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-11-28 12:26:43,259 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-11-28 12:26:43,259 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:63, output treesize:441 [2018-11-28 12:26:43,805 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:43,807 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-11-28 12:26:43,809 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-11-28 12:26:43,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:43,818 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-11-28 12:26:43,819 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:43,826 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-11-28 12:26:43,826 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:43,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:43,847 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-11-28 12:26:43,848 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-11-28 12:26:43,849 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:43,854 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:43,869 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:43,870 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-11-28 12:26:43,871 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-11-28 12:26:43,871 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:43,879 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-11-28 12:26:43,879 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:43,884 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:43,894 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-11-28 12:26:43,895 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-11-28 12:26:43,895 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:43,899 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:43,907 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-11-28 12:26:43,908 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:143, output treesize:39 [2018-11-28 12:26:43,972 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:43,973 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:43,974 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:43,974 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-11-28 12:26:43,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:43,980 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-11-28 12:26:43,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:20 [2018-11-28 12:26:44,918 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 12:26:44,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:26:44,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 38 [2018-11-28 12:26:44,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-28 12:26:44,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-28 12:26:44,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1344, Unknown=0, NotChecked=0, Total=1482 [2018-11-28 12:26:44,934 INFO L87 Difference]: Start difference. First operand 161 states and 187 transitions. Second operand 39 states. [2018-11-28 12:26:46,057 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 66 [2018-11-28 12:26:48,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:48,118 INFO L93 Difference]: Finished difference Result 272 states and 309 transitions. [2018-11-28 12:26:48,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-28 12:26:48,118 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 73 [2018-11-28 12:26:48,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:48,119 INFO L225 Difference]: With dead ends: 272 [2018-11-28 12:26:48,119 INFO L226 Difference]: Without dead ends: 272 [2018-11-28 12:26:48,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1936 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=836, Invalid=6136, Unknown=0, NotChecked=0, Total=6972 [2018-11-28 12:26:48,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-11-28 12:26:48,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 224. [2018-11-28 12:26:48,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-11-28 12:26:48,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 274 transitions. [2018-11-28 12:26:48,125 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 274 transitions. Word has length 73 [2018-11-28 12:26:48,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:48,125 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 274 transitions. [2018-11-28 12:26:48,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-28 12:26:48,125 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 274 transitions. [2018-11-28 12:26:48,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-28 12:26:48,126 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:48,126 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-11-28 12:26:48,126 INFO L423 AbstractCegarLoop]: === Iteration 35 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:26:48,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:48,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1051390995, now seen corresponding path program 1 times [2018-11-28 12:26:48,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:48,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:48,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:48,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:48,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:26:48,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:26:48,901 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/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-11-28 12:26:48,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:48,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:26:48,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:26:48,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:48,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:48,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:26:49,005 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:49,005 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:49,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 12:26:49,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:49,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:49,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-11-28 12:26:49,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:26:49,062 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-11-28 12:26:49,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:49,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:49,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:49,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-11-28 12:26:49,124 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-11-28 12:26:49,125 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-11-28 12:26:49,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:49,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:49,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:49,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-11-28 12:26:49,202 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:49,203 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:49,204 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-11-28 12:26:49,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:49,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:49,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2018-11-28 12:26:49,693 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-11-28 12:26:49,700 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-11-28 12:26:49,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 12:26:49,733 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:49,746 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-11-28 12:26:49,748 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:49,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 12:26:49,827 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:49,899 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-11-28 12:26:49,900 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:49,973 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 12:26:49,981 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:49,990 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-11-28 12:26:49,993 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-11-28 12:26:49,994 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:50,066 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-11-28 12:26:50,066 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:50,139 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-11-28 12:26:50,497 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-11-28 12:26:50,852 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:50,858 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-11-28 12:26:50,861 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-11-28 12:26:50,861 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:50,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:50,878 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-11-28 12:26:50,880 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-11-28 12:26:50,881 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:50,890 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:50,899 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-11-28 12:26:50,906 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-11-28 12:26:50,908 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-11-28 12:26:50,908 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:50,920 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:50,920 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:50,925 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-11-28 12:26:50,927 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-11-28 12:26:50,927 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:50,937 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:50,945 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-11-28 12:26:50,950 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-11-28 12:26:50,951 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-11-28 12:26:50,951 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:50,961 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:50,963 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-11-28 12:26:50,966 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-11-28 12:26:50,967 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:50,977 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:50,984 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-11-28 12:26:50,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:50,992 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-11-28 12:26:50,994 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-11-28 12:26:50,994 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:51,007 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:51,011 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-11-28 12:26:51,014 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-11-28 12:26:51,014 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:51,024 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:51,033 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-11-28 12:26:51,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 125 [2018-11-28 12:26:51,039 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-11-28 12:26:51,039 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:51,049 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:51,051 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-11-28 12:26:51,054 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-11-28 12:26:51,054 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:51,062 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:51,069 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-11-28 12:26:51,076 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-11-28 12:26:51,078 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-11-28 12:26:51,078 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:51,091 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:51,092 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:51,097 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-11-28 12:26:51,099 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-11-28 12:26:51,099 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:51,109 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:51,118 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-11-28 12:26:51,189 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-11-28 12:26:51,189 INFO L202 ElimStorePlain]: Needed 34 recursive calls to eliminate 3 variables, input treesize:333, output treesize:578 [2018-11-28 12:26:51,920 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-11-28 12:26:51,921 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-11-28 12:26:51,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:51,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2018-11-28 12:26:51,932 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:51,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:51,962 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-11-28 12:26:51,964 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-11-28 12:26:51,964 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:51,977 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-11-28 12:26:51,977 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:51,986 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-11-28 12:26:51,987 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:51,994 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:52,012 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-11-28 12:26:52,013 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-11-28 12:26:52,014 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:52,021 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-11-28 12:26:52,021 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:52,027 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-11-28 12:26:52,027 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:52,031 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:52,045 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-11-28 12:26:52,046 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-11-28 12:26:52,046 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:52,051 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-11-28 12:26:52,052 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:52,055 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:52,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:52,064 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 9 variables, input treesize:243, output treesize:7 [2018-11-28 12:26:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:26:52,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:26:52,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 59 [2018-11-28 12:26:52,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-28 12:26:52,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-28 12:26:52,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=3246, Unknown=0, NotChecked=0, Total=3422 [2018-11-28 12:26:52,125 INFO L87 Difference]: Start difference. First operand 224 states and 274 transitions. Second operand 59 states. [2018-11-28 12:26:54,982 WARN L180 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2018-11-28 12:26:56,386 WARN L180 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 119 DAG size of output: 63 [2018-11-28 12:27:05,860 WARN L180 SmtUtils]: Spent 9.39 s on a formula simplification. DAG size of input: 129 DAG size of output: 71 [2018-11-28 12:27:15,326 WARN L180 SmtUtils]: Spent 9.38 s on a formula simplification. DAG size of input: 136 DAG size of output: 79 [2018-11-28 12:27:18,902 WARN L180 SmtUtils]: Spent 3.48 s on a formula simplification. DAG size of input: 144 DAG size of output: 75 [2018-11-28 12:27:19,538 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 92 [2018-11-28 12:27:23,193 WARN L180 SmtUtils]: Spent 3.55 s on a formula simplification. DAG size of input: 141 DAG size of output: 72 [2018-11-28 12:27:23,426 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 96 [2018-11-28 12:27:24,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:24,901 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2018-11-28 12:27:24,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-28 12:27:24,901 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 77 [2018-11-28 12:27:24,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:24,902 INFO L225 Difference]: With dead ends: 208 [2018-11-28 12:27:24,902 INFO L226 Difference]: Without dead ends: 198 [2018-11-28 12:27:24,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 7 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2253 ImplicationChecksByTransitivity, 33.4s TimeCoverageRelationStatistics Valid=797, Invalid=8905, Unknown=0, NotChecked=0, Total=9702 [2018-11-28 12:27:24,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-28 12:27:24,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 188. [2018-11-28 12:27:24,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-28 12:27:24,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 216 transitions. [2018-11-28 12:27:24,905 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 216 transitions. Word has length 77 [2018-11-28 12:27:24,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:24,905 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 216 transitions. [2018-11-28 12:27:24,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-28 12:27:24,905 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 216 transitions. [2018-11-28 12:27:24,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 12:27:24,906 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:24,906 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-11-28 12:27:24,906 INFO L423 AbstractCegarLoop]: === Iteration 36 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:27:24,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:24,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1849361539, now seen corresponding path program 1 times [2018-11-28 12:27:24,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:24,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:24,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:24,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:24,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:27,576 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:27:27,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:27:27,576 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/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-11-28 12:27:27,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:27,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:27:28,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:27:28,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:27:28,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:27:28,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:27:28,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:27:28,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-11-28 12:27:28,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:27:28,175 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-11-28 12:27:28,176 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-11-28 12:27:28,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:27:28,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:27:28,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:27:28,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-11-28 12:27:32,575 WARN L180 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-28 12:27:33,049 WARN L180 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-28 12:27:33,530 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-28 12:27:34,323 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-11-28 12:27:34,359 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:27:34,360 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:27:34,360 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:27:34,369 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-11-28 12:27:34,376 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-11-28 12:27:34,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 12:27:34,397 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:27:34,397 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:27:34,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:27:34,401 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:27:34,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11-28 12:27:34,406 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-11-28 12:27:34,407 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:27:34,418 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:27:34,420 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:27:34,421 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:27:34,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:27:34,424 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:27:34,428 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-11-28 12:27:34,430 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-11-28 12:27:34,430 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:27:34,441 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:27:34,462 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-11-28 12:27:34,485 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-11-28 12:27:34,487 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-11-28 12:27:34,487 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:27:34,495 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:27:34,497 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-11-28 12:27:34,499 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-11-28 12:27:34,499 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:27:34,510 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:27:34,534 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-11-28 12:27:34,534 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:269, output treesize:168 [2018-11-28 12:27:34,941 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:27:34,942 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:27:34,943 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:27:34,946 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-11-28 12:27:34,947 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-11-28 12:27:34,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:27:34,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-28 12:27:34,958 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:27:34,964 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-11-28 12:27:34,964 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:27:34,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:27:34,976 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-11-28 12:27:34,976 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:82, output treesize:40 [2018-11-28 12:27:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 2 not checked. [2018-11-28 12:27:43,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:27:43,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 35] total 72 [2018-11-28 12:27:43,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-11-28 12:27:43,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-11-28 12:27:43,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=4849, Unknown=18, NotChecked=140, Total=5256 [2018-11-28 12:27:43,082 INFO L87 Difference]: Start difference. First operand 188 states and 216 transitions. Second operand 73 states. [2018-11-28 12:27:44,509 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 55 [2018-11-28 12:27:44,770 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 60 [2018-11-28 12:27:45,031 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 63 [2018-11-28 12:27:57,276 WARN L180 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2018-11-28 12:27:58,252 WARN L180 SmtUtils]: Spent 895.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2018-11-28 12:27:59,229 WARN L180 SmtUtils]: Spent 876.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2018-11-28 12:28:00,725 WARN L180 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2018-11-28 12:28:14,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:14,839 INFO L93 Difference]: Finished difference Result 200 states and 227 transitions. [2018-11-28 12:28:14,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-28 12:28:14,840 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 80 [2018-11-28 12:28:14,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:14,840 INFO L225 Difference]: With dead ends: 200 [2018-11-28 12:28:14,840 INFO L226 Difference]: Without dead ends: 197 [2018-11-28 12:28:14,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2052 ImplicationChecksByTransitivity, 29.3s TimeCoverageRelationStatistics Valid=583, Invalid=10308, Unknown=33, NotChecked=206, Total=11130 [2018-11-28 12:28:14,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-28 12:28:14,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 190. [2018-11-28 12:28:14,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-28 12:28:14,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 218 transitions. [2018-11-28 12:28:14,844 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 218 transitions. Word has length 80 [2018-11-28 12:28:14,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:14,845 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 218 transitions. [2018-11-28 12:28:14,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-11-28 12:28:14,845 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 218 transitions. [2018-11-28 12:28:14,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-28 12:28:14,845 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:14,845 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-11-28 12:28:14,846 INFO L423 AbstractCegarLoop]: === Iteration 37 === [sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-11-28 12:28:14,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:14,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1490387668, now seen corresponding path program 1 times [2018-11-28 12:28:14,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:14,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:14,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:14,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:14,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:14,906 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 12:28:14,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:28:14,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/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-11-28 12:28:14,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:28:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:14,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:28:15,004 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 12:28:15,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 12:28:15,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2018-11-28 12:28:15,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 12:28:15,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 12:28:15,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:28:15,020 INFO L87 Difference]: Start difference. First operand 190 states and 218 transitions. Second operand 9 states. [2018-11-28 12:28:15,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:15,034 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-11-28 12:28:15,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:28:15,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2018-11-28 12:28:15,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:15,035 INFO L225 Difference]: With dead ends: 70 [2018-11-28 12:28:15,035 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 12:28:15,035 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-11-28 12:28:15,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 12:28:15,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 12:28:15,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 12:28:15,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 12:28:15,035 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2018-11-28 12:28:15,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:15,035 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:28:15,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 12:28:15,035 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:28:15,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 12:28:15,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:28:15 BoogieIcfgContainer [2018-11-28 12:28:15,039 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:28:15,039 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:28:15,039 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:28:15,040 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:28:15,040 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:23:15" (3/4) ... [2018-11-28 12:28:15,042 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 12:28:15,047 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 12:28:15,047 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-11-28 12:28:15,047 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_remove_first [2018-11-28 12:28:15,047 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-28 12:28:15,047 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-28 12:28:15,048 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_create [2018-11-28 12:28:15,048 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 12:28:15,048 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-11-28 12:28:15,051 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-28 12:28:15,052 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-28 12:28:15,052 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 12:28:15,090 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_18a8b62f-8d00-4096-9641-3a5c203e4ecd/bin-2019/uautomizer/witness.graphml [2018-11-28 12:28:15,091 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:28:15,091 INFO L168 Benchmark]: Toolchain (without parser) took 300356.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 949.6 MB in the beginning and 799.7 MB in the end (delta: 149.8 MB). Peak memory consumption was 293.0 MB. Max. memory is 11.5 GB. [2018-11-28 12:28:15,092 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:28:15,092 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -185.0 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-28 12:28:15,092 INFO L168 Benchmark]: Boogie Preprocessor took 40.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:28:15,092 INFO L168 Benchmark]: RCFGBuilder took 504.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.7 MB). Peak memory consumption was 57.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:28:15,093 INFO L168 Benchmark]: TraceAbstraction took 299433.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -7.3 MB). Free memory was 1.1 GB in the beginning and 805.9 MB in the end (delta: 267.5 MB). Peak memory consumption was 260.2 MB. Max. memory is 11.5 GB. [2018-11-28 12:28:15,093 INFO L168 Benchmark]: Witness Printer took 51.38 ms. Allocated memory is still 1.2 GB. Free memory was 805.9 MB in the beginning and 799.7 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:28:15,094 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 323.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -185.0 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 504.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.7 MB). Peak memory consumption was 57.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 299433.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -7.3 MB). Free memory was 1.1 GB in the beginning and 805.9 MB in the end (delta: 267.5 MB). Peak memory consumption was 260.2 MB. Max. memory is 11.5 GB. * Witness Printer took 51.38 ms. Allocated memory is still 1.2 GB. Free memory was 805.9 MB in the beginning and 799.7 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 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: 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: 591]: 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: 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: 594]: 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: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: 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: 595]: free always succeeds For all program executions holds that free 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: 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: 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: 591]: 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: 588]: 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: 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: 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: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 39 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 111 locations, 39 error locations. SAFE Result, 299.3s OverallTime, 37 OverallIterations, 3 TraceHistogramMax, 235.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2052 SDtfs, 5893 SDslu, 16778 SDs, 0 SdLazy, 35860 SolverSat, 1238 SolverUnsat, 130 SolverUnknown, 0 SolverNotchecked, 150.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2365 GetRequests, 928 SyntacticMatches, 59 SemanticMatches, 1378 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 20931 ImplicationChecksByTransitivity, 135.1s 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.7s SatisfiabilityAnalysisTime, 62.1s 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...