./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse_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_49ad26c3-871f-4422-b234-ddd78c0890ef/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/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 dd9e7bf35989cde866740706d77fd71a632fd664 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:16:06,261 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:16:06,263 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:16:06,270 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:16:06,270 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:16:06,271 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:16:06,272 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:16:06,273 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:16:06,275 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:16:06,275 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:16:06,276 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:16:06,276 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:16:06,277 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:16:06,278 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:16:06,279 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:16:06,279 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:16:06,280 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:16:06,282 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:16:06,283 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:16:06,285 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:16:06,286 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:16:06,287 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:16:06,289 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:16:06,289 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:16:06,289 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:16:06,290 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:16:06,291 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:16:06,291 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:16:06,292 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:16:06,293 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:16:06,293 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:16:06,293 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:16:06,294 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:16:06,294 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:16:06,295 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:16:06,295 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:16:06,295 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 12:16:06,306 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:16:06,306 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:16:06,307 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:16:06,308 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:16:06,308 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:16:06,308 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:16:06,308 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:16:06,309 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:16:06,309 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:16:06,309 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:16:06,309 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:16:06,309 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:16:06,309 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:16:06,310 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 12:16:06,310 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 12:16:06,310 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 12:16:06,310 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:16:06,310 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:16:06,310 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:16:06,311 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:16:06,311 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:16:06,311 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:16:06,311 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:16:06,311 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:16:06,311 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:16:06,312 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:16:06,312 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:16:06,312 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:16:06,312 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_49ad26c3-871f-4422-b234-ddd78c0890ef/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 -> dd9e7bf35989cde866740706d77fd71a632fd664 [2018-11-28 12:16:06,337 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:16:06,347 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:16:06,350 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:16:06,352 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:16:06,352 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:16:06,353 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-28 12:16:06,398 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/bin-2019/uautomizer/data/160f737c3/ff47ecd5fd634295a19b9140964d5083/FLAGe9552c0a4 [2018-11-28 12:16:06,802 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:16:06,803 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-28 12:16:06,813 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/bin-2019/uautomizer/data/160f737c3/ff47ecd5fd634295a19b9140964d5083/FLAGe9552c0a4 [2018-11-28 12:16:06,825 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/bin-2019/uautomizer/data/160f737c3/ff47ecd5fd634295a19b9140964d5083 [2018-11-28 12:16:06,828 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:16:06,829 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 12:16:06,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:16:06,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:16:06,833 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:16:06,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:16:06" (1/1) ... [2018-11-28 12:16:06,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bd24d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:16:06, skipping insertion in model container [2018-11-28 12:16:06,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:16:06" (1/1) ... [2018-11-28 12:16:06,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:16:06,867 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:16:07,055 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:16:07,107 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:16:07,141 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:16:07,165 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:16:07,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:16:07 WrapperNode [2018-11-28 12:16:07,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:16:07,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:16:07,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:16:07,166 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:16:07,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:16:07" (1/1) ... [2018-11-28 12:16:07,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:16:07" (1/1) ... [2018-11-28 12:16:07,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:16:07" (1/1) ... [2018-11-28 12:16:07,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:16:07" (1/1) ... [2018-11-28 12:16:07,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:16:07" (1/1) ... [2018-11-28 12:16:07,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:16:07" (1/1) ... [2018-11-28 12:16:07,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:16:07" (1/1) ... [2018-11-28 12:16:07,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:16:07,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:16:07,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:16:07,211 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:16:07,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:16:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/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:16:07,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 12:16:07,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:16:07,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 12:16:07,245 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 12:16:07,245 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-11-28 12:16:07,245 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-28 12:16:07,245 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-28 12:16:07,245 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-28 12:16:07,245 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-11-28 12:16:07,245 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-11-28 12:16:07,245 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 12:16:07,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 12:16:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 12:16:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 12:16:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 12:16:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 12:16:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 12:16:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 12:16:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 12:16:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 12:16:07,247 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 12:16:07,247 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 12:16:07,247 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 12:16:07,247 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 12:16:07,247 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 12:16:07,247 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 12:16:07,247 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 12:16:07,247 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 12:16:07,247 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 12:16:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 12:16:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 12:16:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 12:16:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 12:16:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 12:16:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 12:16:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 12:16:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 12:16:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 12:16:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 12:16:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 12:16:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 12:16:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 12:16:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 12:16:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 12:16:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 12:16:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 12:16:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 12:16:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 12:16:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 12:16:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 12:16:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 12:16:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 12:16:07,250 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 12:16:07,250 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 12:16:07,250 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 12:16:07,250 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 12:16:07,250 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 12:16:07,250 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 12:16:07,250 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 12:16:07,250 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 12:16:07,250 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 12:16:07,250 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 12:16:07,250 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 12:16:07,250 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 12:16:07,250 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 12:16:07,250 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 12:16:07,251 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 12:16:07,251 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 12:16:07,251 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 12:16:07,251 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 12:16:07,251 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 12:16:07,251 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 12:16:07,251 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-28 12:16:07,251 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 12:16:07,251 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 12:16:07,251 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-28 12:16:07,251 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 12:16:07,251 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 12:16:07,252 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-28 12:16:07,252 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 12:16:07,252 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 12:16:07,252 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 12:16:07,252 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 12:16:07,252 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 12:16:07,252 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 12:16:07,252 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 12:16:07,253 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 12:16:07,253 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 12:16:07,253 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 12:16:07,253 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 12:16:07,253 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 12:16:07,253 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 12:16:07,253 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 12:16:07,253 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 12:16:07,253 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 12:16:07,254 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 12:16:07,254 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 12:16:07,254 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 12:16:07,254 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 12:16:07,254 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 12:16:07,254 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 12:16:07,254 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 12:16:07,254 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 12:16:07,254 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 12:16:07,254 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 12:16:07,255 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 12:16:07,255 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 12:16:07,255 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 12:16:07,255 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 12:16:07,255 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 12:16:07,255 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 12:16:07,255 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 12:16:07,255 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 12:16:07,255 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 12:16:07,256 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 12:16:07,256 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 12:16:07,256 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 12:16:07,256 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-11-28 12:16:07,256 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-28 12:16:07,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:16:07,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 12:16:07,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:16:07,256 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-28 12:16:07,256 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-28 12:16:07,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 12:16:07,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:16:07,257 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-11-28 12:16:07,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:16:07,257 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-11-28 12:16:07,257 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 12:16:07,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 12:16:07,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:16:07,625 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:16:07,626 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-28 12:16:07,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:16:07 BoogieIcfgContainer [2018-11-28 12:16:07,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:16:07,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:16:07,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:16:07,629 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:16:07,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:16:06" (1/3) ... [2018-11-28 12:16:07,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15647d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:16:07, skipping insertion in model container [2018-11-28 12:16:07,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:16:07" (2/3) ... [2018-11-28 12:16:07,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15647d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:16:07, skipping insertion in model container [2018-11-28 12:16:07,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:16:07" (3/3) ... [2018-11-28 12:16:07,633 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-28 12:16:07,641 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:16:07,648 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-11-28 12:16:07,657 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2018-11-28 12:16:07,671 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:16:07,671 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:16:07,671 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 12:16:07,672 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:16:07,672 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:16:07,672 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:16:07,672 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:16:07,672 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:16:07,672 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:16:07,682 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-11-28 12:16:07,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 12:16:07,688 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:16:07,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:16:07,690 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:16:07,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:07,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1323720086, now seen corresponding path program 1 times [2018-11-28 12:16:07,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:07,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:07,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:07,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:07,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:07,812 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:16:07,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:16:07,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:16:07,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:16:07,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:16:07,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:16:07,826 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2018-11-28 12:16:07,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:16:07,903 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-11-28 12:16:07,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:16:07,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-28 12:16:07,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:16:07,913 INFO L225 Difference]: With dead ends: 84 [2018-11-28 12:16:07,913 INFO L226 Difference]: Without dead ends: 77 [2018-11-28 12:16:07,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:16:07,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-28 12:16:07,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-28 12:16:07,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 12:16:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-11-28 12:16:07,938 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 13 [2018-11-28 12:16:07,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:16:07,938 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-11-28 12:16:07,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:16:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-11-28 12:16:07,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 12:16:07,938 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:16:07,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:16:07,939 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:16:07,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:07,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1323720085, now seen corresponding path program 1 times [2018-11-28 12:16:07,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:07,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:07,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:07,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:07,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:07,982 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:16:07,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:16:07,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:16:07,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:16:07,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:16:07,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:16:07,983 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 3 states. [2018-11-28 12:16:08,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:16:08,017 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-11-28 12:16:08,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:16:08,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-28 12:16:08,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:16:08,019 INFO L225 Difference]: With dead ends: 75 [2018-11-28 12:16:08,019 INFO L226 Difference]: Without dead ends: 75 [2018-11-28 12:16:08,020 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:16:08,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-28 12:16:08,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-28 12:16:08,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-28 12:16:08,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-11-28 12:16:08,027 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 13 [2018-11-28 12:16:08,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:16:08,027 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-11-28 12:16:08,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:16:08,027 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-11-28 12:16:08,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 12:16:08,028 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:16:08,028 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:16:08,028 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:16:08,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:08,029 INFO L82 PathProgramCache]: Analyzing trace with hash 303614154, now seen corresponding path program 1 times [2018-11-28 12:16:08,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:08,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:08,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:08,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:08,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:08,067 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:16:08,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:16:08,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:16:08,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:16:08,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:16:08,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:16:08,068 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2018-11-28 12:16:08,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:16:08,107 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2018-11-28 12:16:08,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:16:08,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-28 12:16:08,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:16:08,112 INFO L225 Difference]: With dead ends: 86 [2018-11-28 12:16:08,112 INFO L226 Difference]: Without dead ends: 83 [2018-11-28 12:16:08,112 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:16:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-28 12:16:08,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2018-11-28 12:16:08,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-28 12:16:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-11-28 12:16:08,123 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 18 [2018-11-28 12:16:08,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:16:08,123 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-11-28 12:16:08,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:16:08,123 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-11-28 12:16:08,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 12:16:08,124 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:16:08,124 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:16:08,124 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:16:08,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:08,124 INFO L82 PathProgramCache]: Analyzing trace with hash -677829022, now seen corresponding path program 1 times [2018-11-28 12:16:08,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:08,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:08,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:08,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:08,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:08,224 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:16:08,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:16:08,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:16:08,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:16:08,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:16:08,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:16:08,226 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 6 states. [2018-11-28 12:16:08,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:16:08,338 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-11-28 12:16:08,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:16:08,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-28 12:16:08,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:16:08,341 INFO L225 Difference]: With dead ends: 76 [2018-11-28 12:16:08,341 INFO L226 Difference]: Without dead ends: 76 [2018-11-28 12:16:08,341 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:16:08,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-28 12:16:08,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-11-28 12:16:08,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-28 12:16:08,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-11-28 12:16:08,348 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 19 [2018-11-28 12:16:08,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:16:08,348 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-11-28 12:16:08,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:16:08,348 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-11-28 12:16:08,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 12:16:08,349 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:16:08,349 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:16:08,349 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:16:08,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:08,350 INFO L82 PathProgramCache]: Analyzing trace with hash -677829021, now seen corresponding path program 1 times [2018-11-28 12:16:08,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:08,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:08,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:08,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:08,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:08,427 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:16:08,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:16:08,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:16:08,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:16:08,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:16:08,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:16:08,428 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 6 states. [2018-11-28 12:16:08,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:16:08,513 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-11-28 12:16:08,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:16:08,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-28 12:16:08,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:16:08,514 INFO L225 Difference]: With dead ends: 75 [2018-11-28 12:16:08,514 INFO L226 Difference]: Without dead ends: 75 [2018-11-28 12:16:08,514 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:16:08,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-28 12:16:08,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-11-28 12:16:08,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-28 12:16:08,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-11-28 12:16:08,518 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 19 [2018-11-28 12:16:08,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:16:08,518 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-11-28 12:16:08,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:16:08,518 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-11-28 12:16:08,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 12:16:08,519 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:16:08,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:16:08,519 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:16:08,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:08,520 INFO L82 PathProgramCache]: Analyzing trace with hash 649435046, now seen corresponding path program 1 times [2018-11-28 12:16:08,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:08,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:08,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:08,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:08,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:08,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:16:08,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:16:08,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 12:16:08,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 12:16:08,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 12:16:08,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 12:16:08,631 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 12 states. [2018-11-28 12:16:08,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:16:08,836 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-11-28 12:16:08,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:16:08,837 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-28 12:16:08,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:16:08,837 INFO L225 Difference]: With dead ends: 80 [2018-11-28 12:16:08,838 INFO L226 Difference]: Without dead ends: 80 [2018-11-28 12:16:08,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-11-28 12:16:08,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-28 12:16:08,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-11-28 12:16:08,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 12:16:08,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-11-28 12:16:08,843 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 31 [2018-11-28 12:16:08,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:16:08,843 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-11-28 12:16:08,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 12:16:08,844 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-11-28 12:16:08,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 12:16:08,844 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:16:08,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:16:08,845 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:16:08,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:08,845 INFO L82 PathProgramCache]: Analyzing trace with hash 649435047, now seen corresponding path program 1 times [2018-11-28 12:16:08,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:08,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:08,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:08,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:08,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:16:08,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:16:08,890 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/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:16:08,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:08,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:08,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:16:08,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:16:08,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 12:16:08,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:16:08,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:16:08,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:16:08,991 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 6 states. [2018-11-28 12:16:09,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:16:09,030 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-11-28 12:16:09,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:16:09,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-28 12:16:09,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:16:09,036 INFO L225 Difference]: With dead ends: 91 [2018-11-28 12:16:09,036 INFO L226 Difference]: Without dead ends: 88 [2018-11-28 12:16:09,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:16:09,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-28 12:16:09,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2018-11-28 12:16:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-28 12:16:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-11-28 12:16:09,042 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 31 [2018-11-28 12:16:09,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:16:09,042 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-11-28 12:16:09,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:16:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-11-28 12:16:09,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 12:16:09,044 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:16:09,044 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:16:09,044 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:16:09,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:09,044 INFO L82 PathProgramCache]: Analyzing trace with hash 40947275, now seen corresponding path program 2 times [2018-11-28 12:16:09,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:09,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:09,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:09,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:09,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:09,101 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 12:16:09,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:16:09,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:16:09,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:16:09,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:16:09,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:16:09,102 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 6 states. [2018-11-28 12:16:09,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:16:09,162 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2018-11-28 12:16:09,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:16:09,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-28 12:16:09,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:16:09,164 INFO L225 Difference]: With dead ends: 104 [2018-11-28 12:16:09,164 INFO L226 Difference]: Without dead ends: 104 [2018-11-28 12:16:09,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:16:09,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-28 12:16:09,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2018-11-28 12:16:09,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-28 12:16:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2018-11-28 12:16:09,172 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 44 [2018-11-28 12:16:09,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:16:09,172 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2018-11-28 12:16:09,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:16:09,173 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2018-11-28 12:16:09,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 12:16:09,174 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:16:09,176 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:16:09,176 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:16:09,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:09,176 INFO L82 PathProgramCache]: Analyzing trace with hash 40947330, now seen corresponding path program 1 times [2018-11-28 12:16:09,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:09,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:09,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:09,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:16:09,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:09,326 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:16:09,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:16:09,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 12:16:09,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 12:16:09,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 12:16:09,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:16:09,328 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand 13 states. [2018-11-28 12:16:09,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:16:09,513 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2018-11-28 12:16:09,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 12:16:09,514 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-11-28 12:16:09,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:16:09,515 INFO L225 Difference]: With dead ends: 99 [2018-11-28 12:16:09,515 INFO L226 Difference]: Without dead ends: 99 [2018-11-28 12:16:09,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-28 12:16:09,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-28 12:16:09,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-11-28 12:16:09,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-28 12:16:09,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-11-28 12:16:09,519 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 44 [2018-11-28 12:16:09,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:16:09,520 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-11-28 12:16:09,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 12:16:09,520 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-11-28 12:16:09,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 12:16:09,521 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:16:09,521 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:16:09,521 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:16:09,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:09,521 INFO L82 PathProgramCache]: Analyzing trace with hash 91149112, now seen corresponding path program 1 times [2018-11-28 12:16:09,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:09,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:09,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:09,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:09,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:16:09,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:16:09,867 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/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:16:09,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:09,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:09,925 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:16:09,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:09,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:16:09,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 12:16:10,539 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:16:10,540 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:16:10,541 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:16:10,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:10,545 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:16:10,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-11-28 12:16:10,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 12:16:10,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 12:16:10,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:10,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:16:10,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:16:10,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:27 [2018-11-28 12:16:10,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-28 12:16:10,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-11-28 12:16:10,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:10,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:16:10,835 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:16:10,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:15 [2018-11-28 12:16:10,905 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:16:10,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:16:10,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 32 [2018-11-28 12:16:10,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-28 12:16:10,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-28 12:16:10,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=984, Unknown=2, NotChecked=0, Total=1056 [2018-11-28 12:16:10,922 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 33 states. [2018-11-28 12:16:11,362 WARN L180 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 17 [2018-11-28 12:16:12,009 WARN L180 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2018-11-28 12:16:13,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:16:13,793 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2018-11-28 12:16:13,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-28 12:16:13,794 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-11-28 12:16:13,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:16:13,795 INFO L225 Difference]: With dead ends: 118 [2018-11-28 12:16:13,795 INFO L226 Difference]: Without dead ends: 118 [2018-11-28 12:16:13,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=215, Invalid=2435, Unknown=2, NotChecked=0, Total=2652 [2018-11-28 12:16:13,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-28 12:16:13,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2018-11-28 12:16:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-28 12:16:13,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2018-11-28 12:16:13,807 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 47 [2018-11-28 12:16:13,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:16:13,807 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2018-11-28 12:16:13,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-28 12:16:13,807 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2018-11-28 12:16:13,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 12:16:13,808 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:16:13,808 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:16:13,808 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:16:13,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:13,809 INFO L82 PathProgramCache]: Analyzing trace with hash 91149113, now seen corresponding path program 1 times [2018-11-28 12:16:13,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:13,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:13,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:13,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:13,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:14,391 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:16:14,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:16:14,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/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:16:14,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:14,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:14,451 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:16:14,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:14,458 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:16:14,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:14,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:16:14,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-28 12:16:15,424 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:16:15,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 12:16:15,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:15,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:16:15,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:16:15,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:16:15,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:15,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:16:15,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-11-28 12:16:15,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 12:16:15,469 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:16:15,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:15,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:16:15,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 12:16:15,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 12:16:15,481 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:15,482 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:16:15,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:16:15,489 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:36 [2018-11-28 12:16:15,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-28 12:16:15,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-11-28 12:16:15,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:15,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:16:15,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 19 treesize of output 15 [2018-11-28 12:16:15,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 15 treesize of output 3 [2018-11-28 12:16:15,822 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:15,823 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:16:15,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:16:15,828 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:54, output treesize:18 [2018-11-28 12:16:15,897 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:16:15,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:16:15,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 34 [2018-11-28 12:16:15,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-28 12:16:15,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-28 12:16:15,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1116, Unknown=2, NotChecked=0, Total=1190 [2018-11-28 12:16:15,914 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand 35 states. [2018-11-28 12:16:18,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:16:18,073 INFO L93 Difference]: Finished difference Result 151 states and 174 transitions. [2018-11-28 12:16:18,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 12:16:18,074 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 47 [2018-11-28 12:16:18,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:16:18,075 INFO L225 Difference]: With dead ends: 151 [2018-11-28 12:16:18,075 INFO L226 Difference]: Without dead ends: 151 [2018-11-28 12:16:18,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=194, Invalid=2354, Unknown=2, NotChecked=0, Total=2550 [2018-11-28 12:16:18,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-28 12:16:18,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 114. [2018-11-28 12:16:18,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-28 12:16:18,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 133 transitions. [2018-11-28 12:16:18,082 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 133 transitions. Word has length 47 [2018-11-28 12:16:18,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:16:18,082 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 133 transitions. [2018-11-28 12:16:18,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-28 12:16:18,082 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2018-11-28 12:16:18,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 12:16:18,083 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:16:18,083 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:16:18,083 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:16:18,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:18,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1005485962, now seen corresponding path program 2 times [2018-11-28 12:16:18,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:18,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:18,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:18,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:18,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:18,140 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 12:16:18,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:16:18,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:16:18,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:16:18,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:16:18,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:16:18,141 INFO L87 Difference]: Start difference. First operand 114 states and 133 transitions. Second operand 7 states. [2018-11-28 12:16:18,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:16:18,184 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-11-28 12:16:18,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:16:18,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-11-28 12:16:18,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:16:18,184 INFO L225 Difference]: With dead ends: 90 [2018-11-28 12:16:18,184 INFO L226 Difference]: Without dead ends: 90 [2018-11-28 12:16:18,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:16:18,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-28 12:16:18,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-11-28 12:16:18,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-28 12:16:18,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2018-11-28 12:16:18,187 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 50 [2018-11-28 12:16:18,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:16:18,188 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2018-11-28 12:16:18,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:16:18,188 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2018-11-28 12:16:18,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 12:16:18,190 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:16:18,190 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:16:18,191 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:16:18,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:18,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1201553280, now seen corresponding path program 1 times [2018-11-28 12:16:18,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:18,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:18,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:18,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:16:18,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:18,297 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 12:16:18,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:16:18,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 12:16:18,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 12:16:18,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 12:16:18,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 12:16:18,299 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 12 states. [2018-11-28 12:16:18,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:16:18,479 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-11-28 12:16:18,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:16:18,479 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-11-28 12:16:18,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:16:18,480 INFO L225 Difference]: With dead ends: 95 [2018-11-28 12:16:18,480 INFO L226 Difference]: Without dead ends: 95 [2018-11-28 12:16:18,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-11-28 12:16:18,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-28 12:16:18,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-11-28 12:16:18,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-28 12:16:18,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-11-28 12:16:18,484 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 57 [2018-11-28 12:16:18,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:16:18,484 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-11-28 12:16:18,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 12:16:18,484 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-11-28 12:16:18,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 12:16:18,485 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:16:18,485 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:16:18,485 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:16:18,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:18,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1201553281, now seen corresponding path program 1 times [2018-11-28 12:16:18,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:18,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:18,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:18,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:18,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 12:16:18,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:16:18,510 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/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:16:18,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:18,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:18,574 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 12:16:18,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:16:18,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-28 12:16:18,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:16:18,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:16:18,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:16:18,594 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 5 states. [2018-11-28 12:16:18,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:16:18,637 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2018-11-28 12:16:18,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:16:18,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-11-28 12:16:18,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:16:18,638 INFO L225 Difference]: With dead ends: 100 [2018-11-28 12:16:18,639 INFO L226 Difference]: Without dead ends: 100 [2018-11-28 12:16:18,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:16:18,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-28 12:16:18,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-11-28 12:16:18,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-28 12:16:18,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-11-28 12:16:18,642 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 57 [2018-11-28 12:16:18,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:16:18,642 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-11-28 12:16:18,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:16:18,643 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-11-28 12:16:18,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 12:16:18,643 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:16:18,643 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:16:18,644 INFO L423 AbstractCegarLoop]: === Iteration 15 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:16:18,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:18,644 INFO L82 PathProgramCache]: Analyzing trace with hash 781724054, now seen corresponding path program 1 times [2018-11-28 12:16:18,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:18,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:18,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:18,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:18,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:18,700 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 12:16:18,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:16:18,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:16:18,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:16:18,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:16:18,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:16:18,701 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 7 states. [2018-11-28 12:16:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:16:18,755 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2018-11-28 12:16:18,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:16:18,756 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2018-11-28 12:16:18,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:16:18,757 INFO L225 Difference]: With dead ends: 95 [2018-11-28 12:16:18,757 INFO L226 Difference]: Without dead ends: 95 [2018-11-28 12:16:18,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:16:18,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-28 12:16:18,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-11-28 12:16:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-28 12:16:18,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2018-11-28 12:16:18,761 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 58 [2018-11-28 12:16:18,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:16:18,762 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2018-11-28 12:16:18,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:16:18,762 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2018-11-28 12:16:18,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 12:16:18,763 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:16:18,763 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:16:18,763 INFO L423 AbstractCegarLoop]: === Iteration 16 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:16:18,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:18,763 INFO L82 PathProgramCache]: Analyzing trace with hash 456093685, now seen corresponding path program 2 times [2018-11-28 12:16:18,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:18,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:18,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:18,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:18,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:18,817 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-28 12:16:18,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:16:18,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:16:18,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:16:18,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:16:18,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:16:18,818 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 6 states. [2018-11-28 12:16:18,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:16:18,869 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2018-11-28 12:16:18,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:16:18,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-11-28 12:16:18,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:16:18,873 INFO L225 Difference]: With dead ends: 109 [2018-11-28 12:16:18,873 INFO L226 Difference]: Without dead ends: 109 [2018-11-28 12:16:18,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:16:18,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-28 12:16:18,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-11-28 12:16:18,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-28 12:16:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2018-11-28 12:16:18,876 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 65 [2018-11-28 12:16:18,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:16:18,877 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2018-11-28 12:16:18,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:16:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2018-11-28 12:16:18,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 12:16:18,877 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:16:18,877 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:16:18,878 INFO L423 AbstractCegarLoop]: === Iteration 17 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:16:18,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:18,878 INFO L82 PathProgramCache]: Analyzing trace with hash 456093740, now seen corresponding path program 1 times [2018-11-28 12:16:18,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:18,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:18,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:18,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:16:18,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 12:16:19,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:16:19,104 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/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:16:19,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:19,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:19,158 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:16:19,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:19,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:16:19,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:16:19,413 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 12:16:19,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 12:16:19,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 27 [2018-11-28 12:16:19,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-28 12:16:19,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-28 12:16:19,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2018-11-28 12:16:19,440 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand 28 states. [2018-11-28 12:16:19,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:16:19,842 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2018-11-28 12:16:19,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 12:16:19,842 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 65 [2018-11-28 12:16:19,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:16:19,843 INFO L225 Difference]: With dead ends: 111 [2018-11-28 12:16:19,843 INFO L226 Difference]: Without dead ends: 111 [2018-11-28 12:16:19,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=1184, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 12:16:19,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-28 12:16:19,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2018-11-28 12:16:19,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-28 12:16:19,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2018-11-28 12:16:19,847 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 65 [2018-11-28 12:16:19,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:16:19,847 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2018-11-28 12:16:19,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-28 12:16:19,847 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2018-11-28 12:16:19,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 12:16:19,848 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:16:19,848 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:16:19,848 INFO L423 AbstractCegarLoop]: === Iteration 18 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:16:19,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:19,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1787915394, now seen corresponding path program 1 times [2018-11-28 12:16:19,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:19,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:19,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:19,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:19,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:20,390 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:16:20,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:16:20,390 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/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:16:20,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:20,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:20,441 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:16:20,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:20,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:16:20,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 12:16:20,528 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:16:20,528 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:16:20,529 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:16:20,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:20,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:16:20,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-28 12:16:20,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 12:16:20,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 12:16:20,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:20,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:16:20,578 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:16:20,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2018-11-28 12:16:22,481 WARN L180 SmtUtils]: Spent 1.67 s on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 12:16:22,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-11-28 12:16:22,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2018-11-28 12:16:22,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:22,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:16:22,498 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:16:22,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:22 [2018-11-28 12:16:22,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-11-28 12:16:22,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-28 12:16:22,537 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:16:22,540 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:16:22,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:16:22,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:9 [2018-11-28 12:16:34,986 WARN L180 SmtUtils]: Spent 737.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 12:16:34,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-11-28 12:16:34,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:16:34,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-11-28 12:16:34,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:35,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:16:35,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:16:35,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-11-28 12:16:35,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-28 12:16:35,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-11-28 12:16:35,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:35,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:16:35,117 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:16:35,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:5 [2018-11-28 12:16:35,209 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:16:35,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:16:35,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 49 [2018-11-28 12:16:35,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-28 12:16:35,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-28 12:16:35,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2306, Unknown=13, NotChecked=0, Total=2450 [2018-11-28 12:16:35,226 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand 50 states. [2018-11-28 12:16:37,978 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2018-11-28 12:16:42,200 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2018-11-28 12:16:42,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:16:42,900 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2018-11-28 12:16:42,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-28 12:16:42,901 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 68 [2018-11-28 12:16:42,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:16:42,901 INFO L225 Difference]: With dead ends: 134 [2018-11-28 12:16:42,902 INFO L226 Difference]: Without dead ends: 134 [2018-11-28 12:16:42,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=383, Invalid=5006, Unknown=13, NotChecked=0, Total=5402 [2018-11-28 12:16:42,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-28 12:16:42,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 113. [2018-11-28 12:16:42,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-28 12:16:42,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2018-11-28 12:16:42,907 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 68 [2018-11-28 12:16:42,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:16:42,907 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2018-11-28 12:16:42,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-28 12:16:42,907 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2018-11-28 12:16:42,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 12:16:42,908 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:16:42,908 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:16:42,908 INFO L423 AbstractCegarLoop]: === Iteration 19 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:16:42,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:16:42,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1787915393, now seen corresponding path program 1 times [2018-11-28 12:16:42,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:16:42,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:16:42,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:42,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:42,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:16:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:43,651 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:16:43,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:16:43,651 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/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:16:43,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:16:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:16:43,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:16:43,703 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:16:43,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:43,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:16:43,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 12:16:43,918 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:16:43,919 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:16:43,919 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:16:43,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:43,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:16:43,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-28 12:16:43,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 12:16:43,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 12:16:43,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:43,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:16:43,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 12:16:43,987 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:16:43,988 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:43,989 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:16:43,993 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:16:43,993 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:34, output treesize:20 [2018-11-28 12:16:44,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2018-11-28 12:16:44,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2018-11-28 12:16:44,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:44,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:16:44,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-11-28 12:16:44,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2018-11-28 12:16:44,336 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:44,340 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:16:44,344 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:16:44,345 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:108, output treesize:39 [2018-11-28 12:16:44,384 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:16:44,386 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 25 treesize of output 17 [2018-11-28 12:16:44,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:16:44,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:16:44,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-11-28 12:16:44,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-28 12:16:44,396 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:16:44,400 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:16:44,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:16:44,405 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:12 [2018-11-28 12:18:11,772 WARN L180 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 12:18:11,784 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 44 treesize of output 37 [2018-11-28 12:18:11,788 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:18:11,790 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 37 treesize of output 35 [2018-11-28 12:18:11,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:11,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:18:11,809 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 45 treesize of output 38 [2018-11-28 12:18:11,813 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:18:11,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2018-11-28 12:18:11,815 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:11,821 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:18:11,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:18:11,829 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:77, output treesize:44 [2018-11-28 12:18:11,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-11-28 12:18:11,991 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 33 treesize of output 18 [2018-11-28 12:18:11,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:11,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:18:12,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-28 12:18:12,005 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 11 [2018-11-28 12:18:12,005 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:12,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:18:12,012 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:18:12,012 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:11 [2018-11-28 12:18:12,117 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:18:12,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:18:12,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 57 [2018-11-28 12:18:12,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-28 12:18:12,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-28 12:18:12,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=3100, Unknown=39, NotChecked=0, Total=3306 [2018-11-28 12:18:12,138 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand 58 states. [2018-11-28 12:18:15,833 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 34 [2018-11-28 12:18:16,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:18:16,840 INFO L93 Difference]: Finished difference Result 137 states and 152 transitions. [2018-11-28 12:18:16,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-28 12:18:16,840 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 68 [2018-11-28 12:18:16,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:18:16,841 INFO L225 Difference]: With dead ends: 137 [2018-11-28 12:18:16,841 INFO L226 Difference]: Without dead ends: 137 [2018-11-28 12:18:16,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 92.1s TimeCoverageRelationStatistics Valid=466, Invalid=5975, Unknown=39, NotChecked=0, Total=6480 [2018-11-28 12:18:16,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-28 12:18:16,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 112. [2018-11-28 12:18:16,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-28 12:18:16,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2018-11-28 12:18:16,845 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 68 [2018-11-28 12:18:16,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:18:16,846 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2018-11-28 12:18:16,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-28 12:18:16,846 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2018-11-28 12:18:16,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 12:18:16,846 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:18:16,846 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:18:16,846 INFO L423 AbstractCegarLoop]: === Iteration 20 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:18:16,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:16,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1896395852, now seen corresponding path program 2 times [2018-11-28 12:18:16,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:16,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:16,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:16,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:16,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-28 12:18:16,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:16,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:18:16,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:18:16,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:18:16,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:18:16,889 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand 7 states. [2018-11-28 12:18:16,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:18:16,932 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-11-28 12:18:16,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:18:16,933 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-11-28 12:18:16,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:18:16,933 INFO L225 Difference]: With dead ends: 98 [2018-11-28 12:18:16,933 INFO L226 Difference]: Without dead ends: 98 [2018-11-28 12:18:16,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:18:16,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-28 12:18:16,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-11-28 12:18:16,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-28 12:18:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-11-28 12:18:16,937 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 71 [2018-11-28 12:18:16,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:18:16,937 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-11-28 12:18:16,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:18:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-11-28 12:18:16,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-28 12:18:16,938 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:18:16,938 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:16,938 INFO L423 AbstractCegarLoop]: === Iteration 21 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:18:16,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:16,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1466991259, now seen corresponding path program 1 times [2018-11-28 12:18:16,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:16,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:16,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:16,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:18:16,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:17,011 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-28 12:18:17,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:17,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:18:17,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:18:17,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:18:17,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:18:17,012 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 7 states. [2018-11-28 12:18:17,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:18:17,126 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-11-28 12:18:17,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:18:17,126 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2018-11-28 12:18:17,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:18:17,127 INFO L225 Difference]: With dead ends: 113 [2018-11-28 12:18:17,127 INFO L226 Difference]: Without dead ends: 113 [2018-11-28 12:18:17,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:18:17,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-28 12:18:17,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2018-11-28 12:18:17,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-28 12:18:17,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2018-11-28 12:18:17,130 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 90 [2018-11-28 12:18:17,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:18:17,130 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2018-11-28 12:18:17,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:18:17,130 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2018-11-28 12:18:17,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-28 12:18:17,131 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:18:17,131 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:17,131 INFO L423 AbstractCegarLoop]: === Iteration 22 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:18:17,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:17,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1466991260, now seen corresponding path program 1 times [2018-11-28 12:18:17,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:17,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:17,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:17,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:17,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:17,312 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 12:18:17,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:18:17,312 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/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:18:17,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:17,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:18:17,370 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:18:17,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:17,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:18:17,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:18:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 12:18:17,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 12:18:17,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 25 [2018-11-28 12:18:17,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-28 12:18:17,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-28 12:18:17,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-11-28 12:18:17,745 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 26 states. [2018-11-28 12:18:18,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:18:18,057 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-11-28 12:18:18,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 12:18:18,058 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 90 [2018-11-28 12:18:18,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:18:18,058 INFO L225 Difference]: With dead ends: 105 [2018-11-28 12:18:18,059 INFO L226 Difference]: Without dead ends: 105 [2018-11-28 12:18:18,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 73 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2018-11-28 12:18:18,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-28 12:18:18,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2018-11-28 12:18:18,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-28 12:18:18,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-11-28 12:18:18,061 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 90 [2018-11-28 12:18:18,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:18:18,062 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-11-28 12:18:18,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-28 12:18:18,062 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-11-28 12:18:18,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 12:18:18,062 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:18:18,063 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:18,063 INFO L423 AbstractCegarLoop]: === Iteration 23 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:18:18,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:18,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1842980103, now seen corresponding path program 1 times [2018-11-28 12:18:18,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:18,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:18,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:18,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:18,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:18,164 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 12:18:18,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:18:18,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 12:18:18,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 12:18:18,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 12:18:18,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 12:18:18,165 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 12 states. [2018-11-28 12:18:18,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:18:18,272 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2018-11-28 12:18:18,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 12:18:18,273 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2018-11-28 12:18:18,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:18:18,274 INFO L225 Difference]: With dead ends: 104 [2018-11-28 12:18:18,274 INFO L226 Difference]: Without dead ends: 102 [2018-11-28 12:18:18,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-28 12:18:18,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-28 12:18:18,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-11-28 12:18:18,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-28 12:18:18,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-11-28 12:18:18,277 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 93 [2018-11-28 12:18:18,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:18:18,277 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-11-28 12:18:18,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 12:18:18,278 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-11-28 12:18:18,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 12:18:18,278 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:18:18,278 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:18,279 INFO L423 AbstractCegarLoop]: === Iteration 24 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:18:18,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:18,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1382814895, now seen corresponding path program 1 times [2018-11-28 12:18:18,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:18,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:18,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:18,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:18,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:19,199 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 12:18:19,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:18:19,199 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/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:18:19,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:19,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:18:19,255 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:18:19,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:19,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:18:19,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:18:19,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 12:18:19,451 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:18:19,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:19,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:18:19,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 12:18:19,462 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:18:19,463 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:19,464 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:18:19,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:18:19,470 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-11-28 12:18:19,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-28 12:18:19,515 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:18:19,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 12:18:19,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:19,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:18:19,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-28 12:18:19,537 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:18:19,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 12:18:19,539 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:19,543 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:18:19,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:18:19,550 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:60, output treesize:30 [2018-11-28 12:18:19,638 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:18:19,639 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:18:19,640 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:18:19,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:19,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:18:19,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2018-11-28 12:18:19,739 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:18:19,740 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 23 treesize of output 18 [2018-11-28 12:18:19,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-28 12:18:19,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:19,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:18:19,755 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 23 treesize of output 18 [2018-11-28 12:18:19,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-28 12:18:19,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:19,760 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:18:19,767 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:18:19,767 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:26 [2018-11-28 12:18:22,161 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 30 [2018-11-28 12:18:22,169 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 88 treesize of output 82 [2018-11-28 12:18:22,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2018-11-28 12:18:22,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:22,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:18:22,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-11-28 12:18:22,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2018-11-28 12:18:22,194 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:22,199 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:18:22,204 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:18:22,204 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:103, output treesize:37 [2018-11-28 12:18:22,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 22 treesize of output 18 [2018-11-28 12:18:22,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-28 12:18:22,250 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:18:22,253 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:18:22,261 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 9 treesize of output 7 [2018-11-28 12:18:22,263 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:18:22,263 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:22,264 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:18:22,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:18:22,272 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:12 [2018-11-28 12:18:22,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-11-28 12:18:22,464 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:18:22,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-11-28 12:18:22,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:22,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:18:22,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-28 12:18:22,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:18:22,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 12:18:22,490 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:22,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:18:22,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:18:22,502 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:72, output treesize:42 [2018-11-28 12:18:22,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-28 12:18:22,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2018-11-28 12:18:22,974 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:18:22,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 12:18:23,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-28 12:18:23,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-11-28 12:18:23,015 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 12:18:23,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:18:23,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-28 12:18:23,036 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:74 [2018-11-28 12:18:23,301 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:18:23,301 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:18:23,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:23,308 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:18:23,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:14 [2018-11-28 12:18:23,453 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 12:18:23,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:18:23,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 37] total 65 [2018-11-28 12:18:23,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-28 12:18:23,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-28 12:18:23,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=4090, Unknown=5, NotChecked=0, Total=4290 [2018-11-28 12:18:23,473 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 66 states. [2018-11-28 12:18:27,178 WARN L180 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 32 [2018-11-28 12:18:30,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:18:30,728 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-11-28 12:18:30,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-28 12:18:30,728 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 95 [2018-11-28 12:18:30,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:18:30,729 INFO L225 Difference]: With dead ends: 115 [2018-11-28 12:18:30,729 INFO L226 Difference]: Without dead ends: 115 [2018-11-28 12:18:30,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1915 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=516, Invalid=8032, Unknown=8, NotChecked=0, Total=8556 [2018-11-28 12:18:30,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-28 12:18:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2018-11-28 12:18:30,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-28 12:18:30,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2018-11-28 12:18:30,733 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 95 [2018-11-28 12:18:30,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:18:30,733 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2018-11-28 12:18:30,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-28 12:18:30,733 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2018-11-28 12:18:30,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 12:18:30,734 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:18:30,734 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:18:30,734 INFO L423 AbstractCegarLoop]: === Iteration 25 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:18:30,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:18:30,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1382814894, now seen corresponding path program 1 times [2018-11-28 12:18:30,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:18:30,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:18:30,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:30,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:30,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:18:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:31,738 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-28 12:18:31,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:18:31,738 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/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:18:31,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:18:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:18:31,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:18:31,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:18:31,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:31,790 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:18:31,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:31,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:18:31,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-28 12:18:32,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:18:32,096 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:18:32,097 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:18:32,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:32,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 12:18:32,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:32,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:18:32,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-28 12:18:32,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 12:18:32,197 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:18:32,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:32,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:18:32,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 12:18:32,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 12:18:32,213 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:32,215 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:18:32,224 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:18:32,224 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:51 [2018-11-28 12:18:32,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-28 12:18:32,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-28 12:18:32,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:18:32,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:18:32,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-11-28 12:18:32,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-28 12:18:32,484 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:18:32,487 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:18:32,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:18:32,495 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:21 [2018-11-28 12:19:04,285 WARN L180 SmtUtils]: Spent 2.19 s on a formula simplification that was a NOOP. DAG size: 38 [2018-11-28 12:19:04,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 82 [2018-11-28 12:19:04,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2018-11-28 12:19:04,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:04,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:04,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2018-11-28 12:19:04,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2018-11-28 12:19:04,323 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:04,327 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:04,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:19:04,337 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:131, output treesize:65 [2018-11-28 12:19:04,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-28 12:19:04,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-28 12:19:04,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:04,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:04,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-11-28 12:19:04,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-28 12:19:04,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:19:04,410 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:19:04,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:19:04,417 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:21 [2018-11-28 12:19:31,143 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 12:19:31,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-11-28 12:19:31,158 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:31,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-11-28 12:19:31,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:31,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:31,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-28 12:19:31,191 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:19:31,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-11-28 12:19:31,192 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:19:31,198 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:19:31,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:19:31,211 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:98, output treesize:65 [2018-11-28 12:19:31,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-28 12:19:31,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2018-11-28 12:19:31,640 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:19:31,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 12:19:31,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-11-28 12:19:31,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 19 [2018-11-28 12:19:31,668 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 12:19:31,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:19:31,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-11-28 12:19:31,700 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:69, output treesize:100 [2018-11-28 12:19:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 12:19:32,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:19:32,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 65 [2018-11-28 12:19:32,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-28 12:19:32,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-28 12:19:32,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=4060, Unknown=23, NotChecked=0, Total=4290 [2018-11-28 12:19:32,029 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 66 states. [2018-11-28 12:20:18,397 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 43 [2018-11-28 12:20:33,086 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 12:21:34,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:21:34,345 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-11-28 12:21:34,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-28 12:21:34,345 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 95 [2018-11-28 12:21:34,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:21:34,346 INFO L225 Difference]: With dead ends: 117 [2018-11-28 12:21:34,346 INFO L226 Difference]: Without dead ends: 117 [2018-11-28 12:21:34,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 67 SyntacticMatches, 9 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1862 ImplicationChecksByTransitivity, 66.3s TimeCoverageRelationStatistics Valid=600, Invalid=8119, Unknown=23, NotChecked=0, Total=8742 [2018-11-28 12:21:34,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-28 12:21:34,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 106. [2018-11-28 12:21:34,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-28 12:21:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2018-11-28 12:21:34,349 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 95 [2018-11-28 12:21:34,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:21:34,350 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2018-11-28 12:21:34,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-28 12:21:34,350 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2018-11-28 12:21:34,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-28 12:21:34,350 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:21:34,350 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:21:34,350 INFO L423 AbstractCegarLoop]: === Iteration 26 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:21:34,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:21:34,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1886386321, now seen corresponding path program 1 times [2018-11-28 12:21:34,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:21:34,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:21:34,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:21:34,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:21:34,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:21:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:21:35,209 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 12:21:35,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:21:35,209 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/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:21:35,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:21:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:21:35,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:21:35,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 12:21:35,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 12:21:35,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:21:35,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:21:35,625 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:21:35,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:57 [2018-11-28 12:21:35,864 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:21:35,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-11-28 12:21:35,866 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:21:35,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-11-28 12:21:35,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:21:35,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:21:35,879 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 32 treesize of output 26 [2018-11-28 12:21:35,881 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 26 treesize of output 14 [2018-11-28 12:21:35,881 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:21:35,884 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:21:35,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:21:35,891 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:22 [2018-11-28 12:21:51,149 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 32 [2018-11-28 12:21:51,154 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:21:51,164 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 84 treesize of output 88 [2018-11-28 12:21:51,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2018-11-28 12:21:51,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:21:51,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:21:51,185 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:21:51,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:108, output treesize:75 [2018-11-28 12:21:51,245 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:21:51,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-11-28 12:21:51,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:21:51,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-11-28 12:21:51,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:21:51,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:21:51,260 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 32 treesize of output 26 [2018-11-28 12:21:51,263 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 26 treesize of output 14 [2018-11-28 12:21:51,263 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:21:51,267 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:21:51,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:21:51,273 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:22 [2018-11-28 12:21:51,378 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 66 treesize of output 55 [2018-11-28 12:21:51,381 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:21:51,382 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 55 treesize of output 57 [2018-11-28 12:21:51,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:21:51,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:21:51,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 12:21:51,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:90, output treesize:75 [2018-11-28 12:21:51,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:21:51,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-11-28 12:21:51,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-11-28 12:21:51,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:21:51,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:21:51,493 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:21:51,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:43 [2018-11-28 12:21:51,646 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:21:51,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-11-28 12:21:51,648 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:21:51,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-11-28 12:21:51,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:21:51,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:21:51,659 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:21:51,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:43 [2018-11-28 12:21:51,797 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 17 treesize of output 10 [2018-11-28 12:21:51,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:21:51,804 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:21:51,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:30 [2018-11-28 12:21:52,658 WARN L180 SmtUtils]: Spent 718.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 12:21:54,823 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-28 12:21:56,878 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2018-11-28 12:21:56,882 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 12:21:56,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:21:56,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:21:56,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:90, output treesize:1 [2018-11-28 12:21:56,917 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-28 12:21:56,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:21:56,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 62 [2018-11-28 12:21:56,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-28 12:21:56,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-28 12:21:56,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=3571, Unknown=7, NotChecked=0, Total=3782 [2018-11-28 12:21:56,935 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand 62 states. [2018-11-28 12:22:05,423 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 34 [2018-11-28 12:22:16,136 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2018-11-28 12:22:18,185 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 12:22:19,538 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-28 12:22:20,013 WARN L180 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2018-11-28 12:22:26,433 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-28 12:22:27,164 WARN L180 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-11-28 12:22:27,539 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-11-28 12:22:27,822 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2018-11-28 12:22:27,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:22:27,845 INFO L93 Difference]: Finished difference Result 172 states and 185 transitions. [2018-11-28 12:22:27,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-28 12:22:27,846 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 98 [2018-11-28 12:22:27,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:22:27,846 INFO L225 Difference]: With dead ends: 172 [2018-11-28 12:22:27,847 INFO L226 Difference]: Without dead ends: 170 [2018-11-28 12:22:27,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 72 SyntacticMatches, 6 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2402 ImplicationChecksByTransitivity, 36.6s TimeCoverageRelationStatistics Valid=655, Invalid=9037, Unknown=10, NotChecked=0, Total=9702 [2018-11-28 12:22:27,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-28 12:22:27,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 106. [2018-11-28 12:22:27,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-28 12:22:27,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-11-28 12:22:27,851 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 98 [2018-11-28 12:22:27,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:22:27,851 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-11-28 12:22:27,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-28 12:22:27,851 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-11-28 12:22:27,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-28 12:22:27,852 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:22:27,852 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:22:27,852 INFO L423 AbstractCegarLoop]: === Iteration 27 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:22:27,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:22:27,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1675854939, now seen corresponding path program 2 times [2018-11-28 12:22:27,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:22:27,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:22:27,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:27,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:22:27,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:22:29,285 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 12:22:29,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:22:29,285 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/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:22:29,292 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:22:29,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:22:29,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:22:29,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:22:29,341 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:22:29,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:29,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:29,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:22:29,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 12:22:29,403 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:22:29,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:29,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:29,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 12:22:29,413 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:22:29,414 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:29,415 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:29,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:29,420 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-11-28 12:22:29,738 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:22:29,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:22:29,740 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:22:29,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:29,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-28 12:22:29,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-28 12:22:29,770 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:22:29,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 12:22:29,772 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:29,777 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:29,782 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:29,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-28 12:22:29,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-28 12:22:29,806 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:22:29,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 12:22:29,807 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:29,811 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:29,815 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:29,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:29,840 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:78, output treesize:50 [2018-11-28 12:22:29,974 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:22:29,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-11-28 12:22:29,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-28 12:22:29,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:29,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:29,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-11-28 12:22:30,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-28 12:22:30,001 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:30,006 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:30,016 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:22:30,016 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:56 [2018-11-28 12:22:30,298 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:22:30,299 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:22:30,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 142 [2018-11-28 12:22:30,309 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:22:30,311 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 44 treesize of output 28 [2018-11-28 12:22:30,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:30,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:30,329 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:22:30,329 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:22:30,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 78 [2018-11-28 12:22:30,336 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:22:30,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2018-11-28 12:22:30,337 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:30,342 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:30,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:30,348 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:143, output treesize:53 [2018-11-28 12:22:30,453 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 56 treesize of output 50 [2018-11-28 12:22:30,456 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:22:30,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 64 [2018-11-28 12:22:30,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:30,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:30,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2018-11-28 12:22:30,476 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:22:30,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 12:22:30,477 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:30,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:30,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:30,487 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:53 [2018-11-28 12:22:30,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:22:30,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:30,953 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:22:30,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:63, output treesize:62 [2018-11-28 12:22:31,037 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:22:31,038 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:22:31,038 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 15 treesize of output 8 [2018-11-28 12:22:31,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:31,050 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:22:31,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2018-11-28 12:22:31,054 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:22:31,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-11-28 12:22:31,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:22:31,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-11-28 12:22:31,068 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 12:22:31,076 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 12:22:31,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-11-28 12:22:31,094 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:22:31,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 12:22:31,096 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:31,101 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:31,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-11-28 12:22:31,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-11-28 12:22:31,109 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-28 12:22:31,115 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:22:31,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:22:31,127 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:90, output treesize:28 [2018-11-28 12:22:31,253 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-28 12:22:31,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:22:31,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39] total 58 [2018-11-28 12:22:31,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-28 12:22:31,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-28 12:22:31,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=3108, Unknown=2, NotChecked=0, Total=3306 [2018-11-28 12:22:31,269 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 58 states. [2018-11-28 12:22:34,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:22:34,464 INFO L93 Difference]: Finished difference Result 184 states and 196 transitions. [2018-11-28 12:22:34,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-28 12:22:34,464 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 100 [2018-11-28 12:22:34,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:22:34,465 INFO L225 Difference]: With dead ends: 184 [2018-11-28 12:22:34,466 INFO L226 Difference]: Without dead ends: 184 [2018-11-28 12:22:34,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 64 SyntacticMatches, 25 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1965 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=524, Invalid=6956, Unknown=2, NotChecked=0, Total=7482 [2018-11-28 12:22:34,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-28 12:22:34,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 168. [2018-11-28 12:22:34,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-28 12:22:34,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 180 transitions. [2018-11-28 12:22:34,471 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 180 transitions. Word has length 100 [2018-11-28 12:22:34,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:22:34,471 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 180 transitions. [2018-11-28 12:22:34,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-28 12:22:34,472 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 180 transitions. [2018-11-28 12:22:34,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 12:22:34,472 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:22:34,472 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:22:34,473 INFO L423 AbstractCegarLoop]: === Iteration 28 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:22:34,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:22:34,473 INFO L82 PathProgramCache]: Analyzing trace with hash 693259079, now seen corresponding path program 2 times [2018-11-28 12:22:34,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:22:34,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:22:34,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:34,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:22:34,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:22:35,438 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 12:22:35,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:22:35,438 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/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:22:35,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:22:35,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:22:35,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:22:35,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:22:35,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:35,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:35,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:33 [2018-11-28 12:22:35,717 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:22:35,718 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:22:35,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:35,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:35,726 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:22:35,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:42 [2018-11-28 12:22:35,989 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:22:35,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-28 12:22:35,992 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:22:35,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-11-28 12:22:35,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:35,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:36,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-28 12:22:36,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-11-28 12:22:36,005 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:22:36,008 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:22:36,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:22:36,013 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:18 [2018-11-28 12:22:49,964 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 12:22:49,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 71 [2018-11-28 12:22:49,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:22:49,989 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:22:50,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 61 [2018-11-28 12:22:50,001 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-28 12:22:50,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 37 [2018-11-28 12:22:50,053 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:50,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 12:22:50,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-28 12:22:50,098 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:89, output treesize:116 [2018-11-28 12:22:50,239 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:22:50,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-11-28 12:22:50,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-11-28 12:22:50,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:50,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:50,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:22:50,264 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 47 treesize of output 44 [2018-11-28 12:22:50,266 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:22:50,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-11-28 12:22:50,267 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:50,274 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:50,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-28 12:22:50,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-11-28 12:22:50,288 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:22:50,293 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:22:50,305 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 31 treesize of output 29 [2018-11-28 12:22:50,307 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:22:50,307 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:50,312 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:50,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-28 12:22:50,322 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:92, output treesize:37 [2018-11-28 12:23:03,181 WARN L180 SmtUtils]: Spent 577.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-28 12:23:03,188 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 74 treesize of output 65 [2018-11-28 12:23:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 36 [2018-11-28 12:23:03,197 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:23:03,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 12:23:03,279 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 75 treesize of output 70 [2018-11-28 12:23:03,282 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:23:03,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 12:23:03,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:23:03,298 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:23:03,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-11-28 12:23:03,353 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:150, output treesize:161 [2018-11-28 12:23:03,587 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:23:03,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 47 [2018-11-28 12:23:03,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-11-28 12:23:03,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:23:03,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:23:03,633 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:23:03,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2018-11-28 12:23:03,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-11-28 12:23:03,636 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:23:03,640 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:23:03,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:23:03,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-11-28 12:23:03,667 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:23:03,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-11-28 12:23:03,668 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:23:03,672 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:23:03,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-28 12:23:03,685 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:116, output treesize:67 [2018-11-28 12:23:03,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:23:03,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 47 [2018-11-28 12:23:03,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-11-28 12:23:03,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:23:03,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:23:03,930 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:23:03,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-11-28 12:23:03,932 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:23:03,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-11-28 12:23:03,933 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:23:03,937 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:23:03,955 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:23:03,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-11-28 12:23:03,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:23:03,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-11-28 12:23:03,958 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:23:03,961 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:23:03,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-28 12:23:03,974 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:116, output treesize:67 [2018-11-28 12:23:04,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:23:04,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-11-28 12:23:04,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-11-28 12:23:04,427 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:23:04,432 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:23:04,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:23:04,438 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:55, output treesize:26 [2018-11-28 12:23:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 12:23:17,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:23:17,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34] total 58 [2018-11-28 12:23:17,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-28 12:23:17,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-28 12:23:17,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=3185, Unknown=32, NotChecked=0, Total=3422 [2018-11-28 12:23:17,015 INFO L87 Difference]: Start difference. First operand 168 states and 180 transitions. Second operand 59 states. [2018-11-28 12:23:26,127 WARN L180 SmtUtils]: Spent 1.57 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-28 12:23:27,849 WARN L180 SmtUtils]: Spent 850.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 12:23:31,907 WARN L180 SmtUtils]: Spent 722.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-28 12:23:32,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:23:32,316 INFO L93 Difference]: Finished difference Result 197 states and 209 transitions. [2018-11-28 12:23:32,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-28 12:23:32,317 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 103 [2018-11-28 12:23:32,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:23:32,317 INFO L225 Difference]: With dead ends: 197 [2018-11-28 12:23:32,317 INFO L226 Difference]: Without dead ends: 135 [2018-11-28 12:23:32,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 78 SyntacticMatches, 13 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1471 ImplicationChecksByTransitivity, 45.6s TimeCoverageRelationStatistics Valid=496, Invalid=6612, Unknown=32, NotChecked=0, Total=7140 [2018-11-28 12:23:32,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-28 12:23:32,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 119. [2018-11-28 12:23:32,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-28 12:23:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2018-11-28 12:23:32,324 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 103 [2018-11-28 12:23:32,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:23:32,324 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2018-11-28 12:23:32,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-28 12:23:32,325 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2018-11-28 12:23:32,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-28 12:23:32,325 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:23:32,325 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:23:32,326 INFO L423 AbstractCegarLoop]: === Iteration 29 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-11-28 12:23:32,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:23:32,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1054346185, now seen corresponding path program 3 times [2018-11-28 12:23:32,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:23:32,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:23:32,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:23:32,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:23:32,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:23:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:23:32,389 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-28 12:23:32,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:23:32,389 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/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:23:32,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 12:23:32,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 12:23:32,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:23:32,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:23:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-28 12:23:32,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:23:32,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 12:23:32,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:23:32,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:23:32,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:23:32,531 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand 7 states. [2018-11-28 12:23:32,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:23:32,554 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-11-28 12:23:32,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:23:32,555 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-11-28 12:23:32,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:23:32,555 INFO L225 Difference]: With dead ends: 44 [2018-11-28 12:23:32,555 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 12:23:32,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:23:32,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 12:23:32,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 12:23:32,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 12:23:32,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 12:23:32,556 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2018-11-28 12:23:32,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:23:32,556 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:23:32,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:23:32,556 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:23:32,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 12:23:32,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:23:32 BoogieIcfgContainer [2018-11-28 12:23:32,560 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:23:32,561 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:23:32,561 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:23:32,561 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:23:32,561 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:16:07" (3/4) ... [2018-11-28 12:23:32,566 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 12:23:32,571 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 12:23:32,571 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-11-28 12:23:32,571 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_destroy [2018-11-28 12:23:32,571 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_update_at [2018-11-28 12:23:32,571 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-28 12:23:32,572 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-28 12:23:32,572 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2018-11-28 12:23:32,572 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_get_data_at [2018-11-28 12:23:32,572 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 12:23:32,572 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-11-28 12:23:32,577 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-11-28 12:23:32,577 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-28 12:23:32,578 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 12:23:32,609 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_49ad26c3-871f-4422-b234-ddd78c0890ef/bin-2019/uautomizer/witness.graphml [2018-11-28 12:23:32,609 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:23:32,609 INFO L168 Benchmark]: Toolchain (without parser) took 445781.42 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 234.9 MB). Free memory was 956.0 MB in the beginning and 989.4 MB in the end (delta: -33.4 MB). Peak memory consumption was 201.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:23:32,610 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:23:32,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -159.3 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2018-11-28 12:23:32,610 INFO L168 Benchmark]: Boogie Preprocessor took 44.34 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:23:32,610 INFO L168 Benchmark]: RCFGBuilder took 415.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 11.5 GB. [2018-11-28 12:23:32,611 INFO L168 Benchmark]: TraceAbstraction took 444933.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 97.5 MB). Free memory was 1.1 GB in the beginning and 989.4 MB in the end (delta: 64.2 MB). Peak memory consumption was 161.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:23:32,611 INFO L168 Benchmark]: Witness Printer took 48.02 ms. Allocated memory is still 1.3 GB. Free memory was 989.4 MB in the beginning and 989.4 MB in the end (delta: 10.6 kB). Peak memory consumption was 10.6 kB. Max. memory is 11.5 GB. [2018-11-28 12:23:32,612 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 336.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -159.3 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.34 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 415.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 444933.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 97.5 MB). Free memory was 1.1 GB in the beginning and 989.4 MB in the end (delta: 64.2 MB). Peak memory consumption was 161.7 MB. Max. memory is 11.5 GB. * Witness Printer took 48.02 ms. Allocated memory is still 1.3 GB. Free memory was 989.4 MB in the beginning and 989.4 MB in the end (delta: 10.6 kB). Peak memory consumption was 10.6 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 584]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 584]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 602]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 94 locations, 19 error locations. SAFE Result, 444.8s OverallTime, 29 OverallIterations, 3 TraceHistogramMax, 198.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1791 SDtfs, 2631 SDslu, 14231 SDs, 0 SdLazy, 26394 SolverSat, 755 SolverUnsat, 82 SolverUnknown, 0 SolverNotchecked, 155.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1843 GetRequests, 861 SyntacticMatches, 87 SemanticMatches, 895 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12470 ImplicationChecksByTransitivity, 279.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=27, 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, 29 MinimizatonAttempts, 279 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 244.3s InterpolantComputationTime, 2839 NumberOfCodeBlocks, 2839 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 2796 ConstructedInterpolants, 308 QuantifiedInterpolants, 3120418 SizeOfPredicates, 254 NumberOfNonLiveVariables, 4979 ConjunctsInSsa, 979 ConjunctsInUnsatCore, 43 InterpolantComputations, 17 PerfectInterpolantSequences, 807/1206 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...