./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/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 d9cd680588366d8f4117005099c5fa975e5f03ed ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:25:06,261 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:25:06,262 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:25:06,270 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:25:06,270 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:25:06,271 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:25:06,272 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:25:06,273 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:25:06,274 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:25:06,274 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:25:06,275 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:25:06,275 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:25:06,276 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:25:06,277 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:25:06,278 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:25:06,278 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:25:06,279 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:25:06,280 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:25:06,281 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:25:06,283 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:25:06,283 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:25:06,284 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:25:06,286 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:25:06,286 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:25:06,286 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:25:06,287 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:25:06,288 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:25:06,288 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:25:06,289 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:25:06,290 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:25:06,290 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:25:06,291 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:25:06,291 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:25:06,291 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:25:06,292 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:25:06,292 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:25:06,292 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 12:25:06,302 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:25:06,303 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:25:06,303 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:25:06,303 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:25:06,304 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:25:06,304 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:25:06,304 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:25:06,304 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:25:06,304 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:25:06,304 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:25:06,305 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:25:06,305 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:25:06,305 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:25:06,305 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 12:25:06,305 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 12:25:06,305 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 12:25:06,305 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:25:06,306 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:25:06,306 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:25:06,306 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:25:06,306 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:25:06,306 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:25:06,306 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:25:06,306 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:25:06,307 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:25:06,307 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:25:06,307 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:25:06,307 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:25:06,307 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_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/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 -> d9cd680588366d8f4117005099c5fa975e5f03ed [2018-11-28 12:25:06,328 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:25:06,336 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:25:06,338 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:25:06,339 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:25:06,339 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:25:06,339 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-28 12:25:06,375 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/data/1e47f3ca1/45fe1dce2c80415683fb0ceabe68ee72/FLAGbba24a8fd [2018-11-28 12:25:06,714 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:25:06,714 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/sv-benchmarks/c/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-28 12:25:06,722 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/data/1e47f3ca1/45fe1dce2c80415683fb0ceabe68ee72/FLAGbba24a8fd [2018-11-28 12:25:06,733 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/data/1e47f3ca1/45fe1dce2c80415683fb0ceabe68ee72 [2018-11-28 12:25:06,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:25:06,736 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 12:25:06,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:25:06,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:25:06,740 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:25:06,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:25:06" (1/1) ... [2018-11-28 12:25:06,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da43f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:06, skipping insertion in model container [2018-11-28 12:25:06,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:25:06" (1/1) ... [2018-11-28 12:25:06,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:25:06,776 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:25:06,979 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:25:07,026 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:25:07,057 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:25:07,082 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:25:07,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:07 WrapperNode [2018-11-28 12:25:07,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:25:07,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:25:07,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:25:07,084 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:25:07,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:07" (1/1) ... [2018-11-28 12:25:07,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:07" (1/1) ... [2018-11-28 12:25:07,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:07" (1/1) ... [2018-11-28 12:25:07,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:07" (1/1) ... [2018-11-28 12:25:07,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:07" (1/1) ... [2018-11-28 12:25:07,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:07" (1/1) ... [2018-11-28 12:25:07,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:07" (1/1) ... [2018-11-28 12:25:07,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:25:07,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:25:07,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:25:07,125 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:25:07,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/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:25:07,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 12:25:07,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:25:07,157 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 12:25:07,157 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 12:25:07,157 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-11-28 12:25:07,157 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-28 12:25:07,157 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-28 12:25:07,157 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_remove_first [2018-11-28 12:25:07,157 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 12:25:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 12:25:07,157 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 12:25:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 12:25:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 12:25:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 12:25:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 12:25:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 12:25:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 12:25:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 12:25:07,159 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 12:25:07,159 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 12:25:07,159 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 12:25:07,159 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 12:25:07,159 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 12:25:07,159 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 12:25:07,160 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 12:25:07,160 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 12:25:07,160 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 12:25:07,160 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 12:25:07,160 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 12:25:07,160 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 12:25:07,160 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 12:25:07,160 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 12:25:07,160 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 12:25:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 12:25:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 12:25:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 12:25:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 12:25:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 12:25:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 12:25:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 12:25:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 12:25:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 12:25:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 12:25:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 12:25:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 12:25:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 12:25:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 12:25:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 12:25:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 12:25:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 12:25:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 12:25:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 12:25:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 12:25:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 12:25:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 12:25:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 12:25:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 12:25:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 12:25:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 12:25:07,163 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 12:25:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 12:25:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 12:25:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 12:25:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 12:25:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 12:25:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 12:25:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 12:25:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 12:25:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 12:25:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 12:25:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-28 12:25:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 12:25:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 12:25:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-28 12:25:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 12:25:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 12:25:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-28 12:25:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 12:25:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 12:25:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 12:25:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 12:25:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 12:25:07,167 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 12:25:07,167 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 12:25:07,167 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 12:25:07,167 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 12:25:07,167 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 12:25:07,167 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 12:25:07,167 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 12:25:07,167 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 12:25:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 12:25:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 12:25:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 12:25:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 12:25:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 12:25:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 12:25:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 12:25:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 12:25:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 12:25:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 12:25:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 12:25:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 12:25:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 12:25:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 12:25:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 12:25:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 12:25:07,170 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 12:25:07,170 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 12:25:07,170 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 12:25:07,170 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 12:25:07,170 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 12:25:07,170 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 12:25:07,170 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 12:25:07,170 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 12:25:07,170 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 12:25:07,170 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-11-28 12:25:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-28 12:25:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:25:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 12:25:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:25:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-28 12:25:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure dll_remove_first [2018-11-28 12:25:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 12:25:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:25:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 12:25:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 12:25:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 12:25:07,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:25:07,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:25:07,546 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:25:07,546 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 12:25:07,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:07 BoogieIcfgContainer [2018-11-28 12:25:07,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:25:07,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:25:07,547 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:25:07,548 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:25:07,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:25:06" (1/3) ... [2018-11-28 12:25:07,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294000ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:25:07, skipping insertion in model container [2018-11-28 12:25:07,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:07" (2/3) ... [2018-11-28 12:25:07,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294000ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:25:07, skipping insertion in model container [2018-11-28 12:25:07,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:07" (3/3) ... [2018-11-28 12:25:07,550 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-28 12:25:07,557 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:25:07,563 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2018-11-28 12:25:07,571 INFO L257 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2018-11-28 12:25:07,586 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:25:07,586 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:25:07,586 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 12:25:07,586 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:25:07,586 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:25:07,586 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:25:07,586 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:25:07,586 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:25:07,586 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:25:07,599 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-11-28 12:25:07,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 12:25:07,607 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:07,608 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:07,610 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:07,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:07,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1767081539, now seen corresponding path program 1 times [2018-11-28 12:25:07,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:07,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:07,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:07,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:07,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:07,746 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:25:07,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:07,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:25:07,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:25:07,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:25:07,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:25:07,760 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 3 states. [2018-11-28 12:25:07,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:07,841 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2018-11-28 12:25:07,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:25:07,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-28 12:25:07,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:07,849 INFO L225 Difference]: With dead ends: 69 [2018-11-28 12:25:07,850 INFO L226 Difference]: Without dead ends: 62 [2018-11-28 12:25:07,851 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:25:07,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-28 12:25:07,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2018-11-28 12:25:07,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-28 12:25:07,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-11-28 12:25:07,874 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 11 [2018-11-28 12:25:07,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:07,874 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-11-28 12:25:07,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:25:07,874 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-28 12:25:07,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 12:25:07,875 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:07,875 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:07,875 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:07,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:07,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1767081540, now seen corresponding path program 1 times [2018-11-28 12:25:07,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:07,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:07,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:07,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:07,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:07,920 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:25:07,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:07,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:25:07,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:25:07,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:25:07,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:25:07,922 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 3 states. [2018-11-28 12:25:07,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:07,990 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-11-28 12:25:07,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:25:07,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-28 12:25:07,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:07,991 INFO L225 Difference]: With dead ends: 59 [2018-11-28 12:25:07,991 INFO L226 Difference]: Without dead ends: 59 [2018-11-28 12:25:07,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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:25:07,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-28 12:25:07,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-11-28 12:25:07,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-28 12:25:07,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-11-28 12:25:07,995 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 11 [2018-11-28 12:25:07,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:07,995 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-11-28 12:25:07,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:25:07,995 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-11-28 12:25:07,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 12:25:07,996 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:07,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:07,996 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:07,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:07,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1402216098, now seen corresponding path program 1 times [2018-11-28 12:25:07,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:07,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:07,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:07,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:07,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:08,031 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:25:08,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:08,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:25:08,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:25:08,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:25:08,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:25:08,032 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2018-11-28 12:25:08,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:08,051 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-28 12:25:08,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:25:08,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-28 12:25:08,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:08,053 INFO L225 Difference]: With dead ends: 58 [2018-11-28 12:25:08,053 INFO L226 Difference]: Without dead ends: 58 [2018-11-28 12:25:08,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:25:08,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-28 12:25:08,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-28 12:25:08,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-28 12:25:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-11-28 12:25:08,060 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 15 [2018-11-28 12:25:08,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:08,060 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-11-28 12:25:08,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:25:08,060 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-11-28 12:25:08,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 12:25:08,061 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:08,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:08,061 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:08,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:08,062 INFO L82 PathProgramCache]: Analyzing trace with hash -336303097, now seen corresponding path program 1 times [2018-11-28 12:25:08,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:08,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:08,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:08,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:08,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:08,099 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:25:08,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:08,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:25:08,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:25:08,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:25:08,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:25:08,100 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 3 states. [2018-11-28 12:25:08,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:08,120 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-28 12:25:08,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:25:08,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-28 12:25:08,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:08,122 INFO L225 Difference]: With dead ends: 66 [2018-11-28 12:25:08,122 INFO L226 Difference]: Without dead ends: 66 [2018-11-28 12:25:08,122 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:25:08,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-28 12:25:08,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2018-11-28 12:25:08,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-28 12:25:08,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-11-28 12:25:08,127 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 15 [2018-11-28 12:25:08,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:08,128 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-11-28 12:25:08,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:25:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-28 12:25:08,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 12:25:08,128 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:08,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:08,129 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:08,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:08,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1090178234, now seen corresponding path program 1 times [2018-11-28 12:25:08,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:08,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:08,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:08,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:08,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:08,188 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:25:08,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:08,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:25:08,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:25:08,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:25:08,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:25:08,191 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 6 states. [2018-11-28 12:25:08,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:08,391 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-11-28 12:25:08,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:25:08,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-28 12:25:08,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:08,392 INFO L225 Difference]: With dead ends: 84 [2018-11-28 12:25:08,392 INFO L226 Difference]: Without dead ends: 84 [2018-11-28 12:25:08,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:25:08,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-28 12:25:08,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 69. [2018-11-28 12:25:08,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-28 12:25:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-11-28 12:25:08,398 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 17 [2018-11-28 12:25:08,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:08,398 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-11-28 12:25:08,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:25:08,398 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-11-28 12:25:08,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 12:25:08,399 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:08,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:08,399 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:08,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:08,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1090178235, now seen corresponding path program 1 times [2018-11-28 12:25:08,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:08,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:08,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:08,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:08,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:08,445 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:25:08,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:08,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:25:08,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:25:08,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:25:08,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:25:08,446 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 5 states. [2018-11-28 12:25:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:08,464 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-11-28 12:25:08,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:25:08,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-28 12:25:08,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:08,465 INFO L225 Difference]: With dead ends: 65 [2018-11-28 12:25:08,465 INFO L226 Difference]: Without dead ends: 62 [2018-11-28 12:25:08,465 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:25:08,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-28 12:25:08,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-11-28 12:25:08,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-28 12:25:08,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-11-28 12:25:08,469 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 17 [2018-11-28 12:25:08,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:08,469 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-11-28 12:25:08,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:25:08,469 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-11-28 12:25:08,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 12:25:08,470 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:08,470 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:08,470 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:08,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:08,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1878714113, now seen corresponding path program 1 times [2018-11-28 12:25:08,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:08,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:08,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:08,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:08,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:08,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:08,541 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/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:25:08,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:08,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:08,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:25:08,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:08,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:08,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 12:25:08,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:08,626 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:08,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-28 12:25:08,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:08,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:08,637 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-11-28 12:25:08,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:08,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:08,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2018-11-28 12:25:08,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:25:08,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:25:08,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:25:08,678 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 7 states. [2018-11-28 12:25:08,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:08,793 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-28 12:25:08,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:25:08,793 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-28 12:25:08,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:08,794 INFO L225 Difference]: With dead ends: 65 [2018-11-28 12:25:08,794 INFO L226 Difference]: Without dead ends: 65 [2018-11-28 12:25:08,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:25:08,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-28 12:25:08,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-11-28 12:25:08,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-28 12:25:08,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-11-28 12:25:08,797 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 22 [2018-11-28 12:25:08,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:08,798 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-11-28 12:25:08,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:25:08,798 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-11-28 12:25:08,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 12:25:08,798 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:08,798 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:08,799 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:08,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:08,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1878714112, now seen corresponding path program 1 times [2018-11-28 12:25:08,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:08,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:08,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:08,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:08,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:08,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:08,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:08,898 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/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:25:08,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:08,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:08,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:25:08,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:08,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:25:08,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:08,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:08,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-28 12:25:08,990 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:08,991 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:25:08,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:09,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:09,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:09,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 12:25:09,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:09,006 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:25:09,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-11-28 12:25:09,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:09,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:09,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5] total 7 [2018-11-28 12:25:09,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 12:25:09,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 12:25:09,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:25:09,038 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 8 states. [2018-11-28 12:25:09,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:09,198 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-28 12:25:09,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:25:09,199 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-28 12:25:09,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:09,199 INFO L225 Difference]: With dead ends: 64 [2018-11-28 12:25:09,199 INFO L226 Difference]: Without dead ends: 64 [2018-11-28 12:25:09,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:25:09,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-28 12:25:09,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2018-11-28 12:25:09,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-28 12:25:09,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2018-11-28 12:25:09,202 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 22 [2018-11-28 12:25:09,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:09,203 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-11-28 12:25:09,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 12:25:09,203 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-11-28 12:25:09,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 12:25:09,203 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:09,203 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] [2018-11-28 12:25:09,203 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:09,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:09,204 INFO L82 PathProgramCache]: Analyzing trace with hash 596908978, now seen corresponding path program 1 times [2018-11-28 12:25:09,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:09,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:09,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:09,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:09,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:09,243 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:25:09,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:09,244 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/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:25:09,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:09,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:09,294 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:25:09,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:09,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 12:25:09,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:25:09,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:25:09,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:25:09,310 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 6 states. [2018-11-28 12:25:09,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:09,350 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-11-28 12:25:09,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:25:09,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-28 12:25:09,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:09,351 INFO L225 Difference]: With dead ends: 71 [2018-11-28 12:25:09,352 INFO L226 Difference]: Without dead ends: 68 [2018-11-28 12:25:09,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 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:25:09,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-28 12:25:09,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2018-11-28 12:25:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-28 12:25:09,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-11-28 12:25:09,356 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 24 [2018-11-28 12:25:09,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:09,356 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-11-28 12:25:09,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:25:09,356 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-11-28 12:25:09,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 12:25:09,357 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:09,357 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:09,357 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:09,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:09,358 INFO L82 PathProgramCache]: Analyzing trace with hash 279610810, now seen corresponding path program 2 times [2018-11-28 12:25:09,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:09,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:09,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:09,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:09,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:09,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:09,409 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/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:25:09,419 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:25:09,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:25:09,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:25:09,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:09,470 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:09,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:09,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 6 [2018-11-28 12:25:09,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:25:09,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:25:09,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:25:09,496 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 6 states. [2018-11-28 12:25:09,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:09,530 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-11-28 12:25:09,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:25:09,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-28 12:25:09,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:09,530 INFO L225 Difference]: With dead ends: 61 [2018-11-28 12:25:09,530 INFO L226 Difference]: Without dead ends: 61 [2018-11-28 12:25:09,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:25:09,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-28 12:25:09,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-28 12:25:09,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-28 12:25:09,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-11-28 12:25:09,532 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 31 [2018-11-28 12:25:09,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:09,533 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-11-28 12:25:09,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:25:09,533 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-11-28 12:25:09,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 12:25:09,533 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:09,533 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:09,533 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:09,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:09,533 INFO L82 PathProgramCache]: Analyzing trace with hash 898443166, now seen corresponding path program 1 times [2018-11-28 12:25:09,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:09,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:09,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:09,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:25:09,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:09,726 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:09,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:09,727 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:25:09,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:09,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:09,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:25:09,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:09,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:09,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 12:25:10,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:10,174 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:10,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-28 12:25:10,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-28 12:25:10,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:10,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:10,191 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:25:10,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:20 [2018-11-28 12:25:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:10,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:10,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-11-28 12:25:10,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 12:25:10,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 12:25:10,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=188, Unknown=1, NotChecked=0, Total=240 [2018-11-28 12:25:10,262 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 16 states. [2018-11-28 12:25:13,167 WARN L180 SmtUtils]: Spent 636.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-28 12:25:14,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:14,585 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-11-28 12:25:14,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:25:14,586 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-11-28 12:25:14,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:14,586 INFO L225 Difference]: With dead ends: 92 [2018-11-28 12:25:14,586 INFO L226 Difference]: Without dead ends: 92 [2018-11-28 12:25:14,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=99, Invalid=316, Unknown=5, NotChecked=0, Total=420 [2018-11-28 12:25:14,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-28 12:25:14,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2018-11-28 12:25:14,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 12:25:14,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-11-28 12:25:14,590 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 32 [2018-11-28 12:25:14,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:14,590 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-11-28 12:25:14,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 12:25:14,590 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-11-28 12:25:14,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 12:25:14,591 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:14,591 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:14,591 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:14,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:14,591 INFO L82 PathProgramCache]: Analyzing trace with hash 898443167, now seen corresponding path program 1 times [2018-11-28 12:25:14,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:14,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:14,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:14,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:14,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:14,734 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:14,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:14,734 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:25:14,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:14,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:14,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:25:14,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:14,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:25:14,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:14,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:14,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-28 12:25:14,850 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:14,851 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:14,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-28 12:25:14,854 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:14,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-11-28 12:25:14,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:14,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:14,869 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:14,870 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:14,870 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:14,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 12:25:14,871 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:14,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:14,883 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 [2018-11-28 12:25:14,931 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:14,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:14,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-11-28 12:25:14,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 12:25:14,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 12:25:14,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-11-28 12:25:14,947 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 15 states. [2018-11-28 12:25:17,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:17,891 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2018-11-28 12:25:17,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:25:17,891 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-11-28 12:25:17,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:17,892 INFO L225 Difference]: With dead ends: 103 [2018-11-28 12:25:17,892 INFO L226 Difference]: Without dead ends: 103 [2018-11-28 12:25:17,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=77, Invalid=301, Unknown=2, NotChecked=0, Total=380 [2018-11-28 12:25:17,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-28 12:25:17,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2018-11-28 12:25:17,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-28 12:25:17,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2018-11-28 12:25:17,895 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 32 [2018-11-28 12:25:17,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:17,896 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2018-11-28 12:25:17,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 12:25:17,896 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2018-11-28 12:25:17,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 12:25:17,896 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:17,897 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:17,897 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:17,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:17,897 INFO L82 PathProgramCache]: Analyzing trace with hash 2081934351, now seen corresponding path program 1 times [2018-11-28 12:25:17,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:17,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:17,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:17,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:17,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:17,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:25:17,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:17,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 12:25:17,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 12:25:17,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 12:25:17,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:25:17,975 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand 10 states. [2018-11-28 12:25:18,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:18,150 INFO L93 Difference]: Finished difference Result 118 states and 141 transitions. [2018-11-28 12:25:18,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:25:18,150 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-11-28 12:25:18,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:18,151 INFO L225 Difference]: With dead ends: 118 [2018-11-28 12:25:18,151 INFO L226 Difference]: Without dead ends: 118 [2018-11-28 12:25:18,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-28 12:25:18,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-28 12:25:18,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 98. [2018-11-28 12:25:18,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-28 12:25:18,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2018-11-28 12:25:18,155 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 33 [2018-11-28 12:25:18,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:18,156 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2018-11-28 12:25:18,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 12:25:18,156 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2018-11-28 12:25:18,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 12:25:18,157 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:18,157 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:18,157 INFO L423 AbstractCegarLoop]: === Iteration 14 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:18,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:18,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2081934352, now seen corresponding path program 1 times [2018-11-28 12:25:18,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:18,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:18,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:18,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:18,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:18,238 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:25:18,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:18,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 12:25:18,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 12:25:18,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 12:25:18,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:25:18,239 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand 10 states. [2018-11-28 12:25:18,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:18,458 INFO L93 Difference]: Finished difference Result 121 states and 144 transitions. [2018-11-28 12:25:18,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 12:25:18,459 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-11-28 12:25:18,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:18,459 INFO L225 Difference]: With dead ends: 121 [2018-11-28 12:25:18,460 INFO L226 Difference]: Without dead ends: 121 [2018-11-28 12:25:18,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-28 12:25:18,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-28 12:25:18,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 98. [2018-11-28 12:25:18,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-28 12:25:18,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2018-11-28 12:25:18,465 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 33 [2018-11-28 12:25:18,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:18,466 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2018-11-28 12:25:18,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 12:25:18,466 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2018-11-28 12:25:18,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 12:25:18,466 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:18,467 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:18,467 INFO L423 AbstractCegarLoop]: === Iteration 15 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:18,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:18,467 INFO L82 PathProgramCache]: Analyzing trace with hash -716486686, now seen corresponding path program 1 times [2018-11-28 12:25:18,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:18,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:18,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:18,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:18,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:18,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:18,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:18,663 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:25:18,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:18,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:18,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:25:18,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:18,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:18,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 12:25:18,736 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:18,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:18,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:25:18,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:18,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:18,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-28 12:25:18,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 13 treesize of output 10 [2018-11-28 12:25:18,757 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:25:18,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:18,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:18,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:18,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-11-28 12:25:18,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, 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:25:18,786 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:18,787 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 27 [2018-11-28 12:25:18,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:18,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:18,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:18,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-28 12:25:18,818 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:25:18,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-28 12:25:18,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:18,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:18,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:18,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:46 [2018-11-28 12:25:19,085 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 93 treesize of output 83 [2018-11-28 12:25:19,087 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 83 treesize of output 70 [2018-11-28 12:25:19,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:19,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:19,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:19,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:77 [2018-11-28 12:25:19,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 64 [2018-11-28 12:25:19,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-11-28 12:25:19,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:19,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-11-28 12:25:19,197 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:19,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2018-11-28 12:25:19,225 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:19,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:19,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 14 [2018-11-28 12:25:19,248 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:19,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:19,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:19,258 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:83, output treesize:5 [2018-11-28 12:25:19,261 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:19,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:19,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 27 [2018-11-28 12:25:19,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-28 12:25:19,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-28 12:25:19,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=694, Unknown=0, NotChecked=0, Total=756 [2018-11-28 12:25:19,276 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand 28 states. [2018-11-28 12:25:20,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:20,579 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2018-11-28 12:25:20,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-28 12:25:20,579 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 36 [2018-11-28 12:25:20,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:20,579 INFO L225 Difference]: With dead ends: 125 [2018-11-28 12:25:20,580 INFO L226 Difference]: Without dead ends: 125 [2018-11-28 12:25:20,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=256, Invalid=1906, Unknown=0, NotChecked=0, Total=2162 [2018-11-28 12:25:20,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-28 12:25:20,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2018-11-28 12:25:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-28 12:25:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2018-11-28 12:25:20,583 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 36 [2018-11-28 12:25:20,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:20,585 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2018-11-28 12:25:20,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-28 12:25:20,585 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2018-11-28 12:25:20,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 12:25:20,585 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:20,585 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:20,585 INFO L423 AbstractCegarLoop]: === Iteration 16 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:20,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:20,585 INFO L82 PathProgramCache]: Analyzing trace with hash -716486685, now seen corresponding path program 1 times [2018-11-28 12:25:20,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:20,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:20,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:20,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:20,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:20,923 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:20,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:20,924 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:25:20,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:20,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:20,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:25:20,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:20,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:20,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:25:21,020 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:21,021 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:21,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 12:25:21,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:21,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:21,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-11-28 12:25:21,068 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:25:21,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:25:21,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:21,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:21,079 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:25:21,081 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:25:21,081 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:21,082 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:21,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:21,089 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-11-28 12:25:21,113 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:25:21,115 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:21,117 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 27 [2018-11-28 12:25:21,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:21,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:21,133 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:25:21,136 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:21,136 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:25:21,137 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 36 [2018-11-28 12:25:21,137 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:21,141 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:21,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:21,150 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2018-11-28 12:25:21,182 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 83 treesize of output 77 [2018-11-28 12:25:21,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-28 12:25:21,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:21,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:21,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-11-28 12:25:21,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-28 12:25:21,209 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:21,215 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:21,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:21,226 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:113, output treesize:93 [2018-11-28 12:25:21,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 183 treesize of output 148 [2018-11-28 12:25:21,642 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 137 treesize of output 128 [2018-11-28 12:25:21,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:21,695 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:21,696 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 133 treesize of output 103 [2018-11-28 12:25:21,697 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:21,748 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:21,749 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 128 treesize of output 98 [2018-11-28 12:25:21,750 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:21,797 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:21,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2018-11-28 12:25:21,799 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:21,846 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 131 treesize of output 122 [2018-11-28 12:25:21,846 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:21,889 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 82 treesize of output 72 [2018-11-28 12:25:21,889 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:21,932 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:25:21,932 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:21,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 103 [2018-11-28 12:25:21,933 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:21,973 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:21,974 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:21,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 104 [2018-11-28 12:25:21,977 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:22,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-28 12:25:22,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 70 [2018-11-28 12:25:22,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 57 [2018-11-28 12:25:22,058 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:22,079 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:22,079 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 57 treesize of output 45 [2018-11-28 12:25:22,080 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:22,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-11-28 12:25:22,099 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:22,116 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:22,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2018-11-28 12:25:22,117 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:22,133 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:22,134 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 43 treesize of output 33 [2018-11-28 12:25:22,134 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:22,147 INFO L267 ElimStorePlain]: Start of recursive call 11: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:25:22,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 70 [2018-11-28 12:25:22,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 53 [2018-11-28 12:25:22,155 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:22,176 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:22,177 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:22,178 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:22,178 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:25:22,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 55 [2018-11-28 12:25:22,179 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:22,201 INFO L267 ElimStorePlain]: Start of recursive call 17: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:22,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 66 [2018-11-28 12:25:22,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-11-28 12:25:22,208 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:22,220 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:22,221 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 28 treesize of output 16 [2018-11-28 12:25:22,221 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:22,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 12:25:22,235 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:22,241 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:22,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 74 [2018-11-28 12:25:22,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 53 [2018-11-28 12:25:22,255 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:22,322 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:22,323 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:22,323 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:22,324 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:25:22,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 55 [2018-11-28 12:25:22,325 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:22,361 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:22,362 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 58 treesize of output 46 [2018-11-28 12:25:22,363 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:22,385 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:22,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-11-28 12:25:22,386 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:22,407 INFO L267 ElimStorePlain]: Start of recursive call 24: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:22,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:25:22,429 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 4 variables, input treesize:203, output treesize:23 [2018-11-28 12:25:22,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:22,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:22,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2018-11-28 12:25:22,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-28 12:25:22,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-28 12:25:22,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1105, Unknown=0, NotChecked=0, Total=1190 [2018-11-28 12:25:22,505 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand 35 states. [2018-11-28 12:25:23,897 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 98 [2018-11-28 12:25:24,071 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2018-11-28 12:25:24,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:24,534 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2018-11-28 12:25:24,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-28 12:25:24,534 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 36 [2018-11-28 12:25:24,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:24,535 INFO L225 Difference]: With dead ends: 136 [2018-11-28 12:25:24,535 INFO L226 Difference]: Without dead ends: 136 [2018-11-28 12:25:24,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=327, Invalid=2535, Unknown=0, NotChecked=0, Total=2862 [2018-11-28 12:25:24,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-28 12:25:24,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 116. [2018-11-28 12:25:24,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-28 12:25:24,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2018-11-28 12:25:24,540 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 36 [2018-11-28 12:25:24,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:24,540 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2018-11-28 12:25:24,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-28 12:25:24,541 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2018-11-28 12:25:24,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 12:25:24,541 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:24,541 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:24,542 INFO L423 AbstractCegarLoop]: === Iteration 17 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:24,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:24,542 INFO L82 PathProgramCache]: Analyzing trace with hash -736245799, now seen corresponding path program 1 times [2018-11-28 12:25:24,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:24,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:24,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:24,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:24,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:25:24,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:24,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 12:25:24,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 12:25:24,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 12:25:24,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:25:24,641 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand 10 states. [2018-11-28 12:25:24,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:24,736 INFO L93 Difference]: Finished difference Result 122 states and 140 transitions. [2018-11-28 12:25:24,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:25:24,736 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-11-28 12:25:24,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:24,737 INFO L225 Difference]: With dead ends: 122 [2018-11-28 12:25:24,737 INFO L226 Difference]: Without dead ends: 122 [2018-11-28 12:25:24,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-28 12:25:24,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-28 12:25:24,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2018-11-28 12:25:24,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-28 12:25:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 140 transitions. [2018-11-28 12:25:24,741 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 140 transitions. Word has length 37 [2018-11-28 12:25:24,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:24,741 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 140 transitions. [2018-11-28 12:25:24,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 12:25:24,741 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 140 transitions. [2018-11-28 12:25:24,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-28 12:25:24,742 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:24,742 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:24,742 INFO L423 AbstractCegarLoop]: === Iteration 18 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:24,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:24,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1348783229, now seen corresponding path program 1 times [2018-11-28 12:25:24,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:24,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:24,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:24,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:24,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:24,792 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 12:25:24,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:24,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:25:24,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:25:24,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:25:24,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:25:24,794 INFO L87 Difference]: Start difference. First operand 116 states and 140 transitions. Second operand 5 states. [2018-11-28 12:25:24,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:24,856 INFO L93 Difference]: Finished difference Result 130 states and 156 transitions. [2018-11-28 12:25:24,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:25:24,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-28 12:25:24,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:24,860 INFO L225 Difference]: With dead ends: 130 [2018-11-28 12:25:24,860 INFO L226 Difference]: Without dead ends: 130 [2018-11-28 12:25:24,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:25:24,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-28 12:25:24,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2018-11-28 12:25:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-28 12:25:24,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 156 transitions. [2018-11-28 12:25:24,864 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 156 transitions. Word has length 38 [2018-11-28 12:25:24,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:24,864 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 156 transitions. [2018-11-28 12:25:24,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:25:24,864 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 156 transitions. [2018-11-28 12:25:24,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 12:25:24,865 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:24,865 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:24,865 INFO L423 AbstractCegarLoop]: === Iteration 19 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:24,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:24,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1132592664, now seen corresponding path program 1 times [2018-11-28 12:25:24,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:24,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:24,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:24,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:24,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:24,977 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 12:25:24,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:24,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 12:25:24,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 12:25:24,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 12:25:24,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:25:24,978 INFO L87 Difference]: Start difference. First operand 128 states and 156 transitions. Second operand 11 states. [2018-11-28 12:25:25,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:25,155 INFO L93 Difference]: Finished difference Result 132 states and 154 transitions. [2018-11-28 12:25:25,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:25:25,155 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2018-11-28 12:25:25,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:25,155 INFO L225 Difference]: With dead ends: 132 [2018-11-28 12:25:25,156 INFO L226 Difference]: Without dead ends: 132 [2018-11-28 12:25:25,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-11-28 12:25:25,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-28 12:25:25,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2018-11-28 12:25:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-28 12:25:25,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 147 transitions. [2018-11-28 12:25:25,159 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 147 transitions. Word has length 39 [2018-11-28 12:25:25,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:25,159 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 147 transitions. [2018-11-28 12:25:25,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 12:25:25,159 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 147 transitions. [2018-11-28 12:25:25,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 12:25:25,160 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:25,160 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:25,160 INFO L423 AbstractCegarLoop]: === Iteration 20 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:25,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:25,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1137392924, now seen corresponding path program 1 times [2018-11-28 12:25:25,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:25,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:25,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:25,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:25,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:25,352 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:25,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:25,352 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:25:25,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:25,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:25,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 6 treesize of output 5 [2018-11-28 12:25:25,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:25,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:25,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:25:26,507 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:26,508 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:26,508 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:26,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 12:25:26,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:26,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:26,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:8 [2018-11-28 12:25:26,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-28 12:25:26,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-28 12:25:26,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:26,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:26,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:26,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-11-28 12:25:26,600 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:26,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-28 12:25:26,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:26,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:26,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-11-28 12:25:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:26,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:26,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2018-11-28 12:25:26,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-28 12:25:26,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-28 12:25:26,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=727, Unknown=3, NotChecked=0, Total=812 [2018-11-28 12:25:26,650 INFO L87 Difference]: Start difference. First operand 122 states and 147 transitions. Second operand 29 states. [2018-11-28 12:25:39,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:39,517 INFO L93 Difference]: Finished difference Result 135 states and 160 transitions. [2018-11-28 12:25:39,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 12:25:39,517 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 39 [2018-11-28 12:25:39,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:39,518 INFO L225 Difference]: With dead ends: 135 [2018-11-28 12:25:39,518 INFO L226 Difference]: Without dead ends: 135 [2018-11-28 12:25:39,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=192, Invalid=1365, Unknown=3, NotChecked=0, Total=1560 [2018-11-28 12:25:39,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-28 12:25:39,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 126. [2018-11-28 12:25:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-28 12:25:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 151 transitions. [2018-11-28 12:25:39,521 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 151 transitions. Word has length 39 [2018-11-28 12:25:39,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:39,521 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 151 transitions. [2018-11-28 12:25:39,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-28 12:25:39,521 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 151 transitions. [2018-11-28 12:25:39,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 12:25:39,522 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:39,522 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:39,522 INFO L423 AbstractCegarLoop]: === Iteration 21 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:39,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:39,523 INFO L82 PathProgramCache]: Analyzing trace with hash 750634279, now seen corresponding path program 1 times [2018-11-28 12:25:39,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:39,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:39,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:39,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:39,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:39,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:39,760 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:25:39,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:39,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:39,792 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 6 treesize of output 5 [2018-11-28 12:25:39,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:39,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:39,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-11-28 12:25:40,847 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:40,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:40,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:40,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 12:25:40,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:40,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:40,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:12 [2018-11-28 12:25:40,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 34 [2018-11-28 12:25:40,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-11-28 12:25:40,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:40,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:40,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:40,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2018-11-28 12:25:41,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2018-11-28 12:25:41,009 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 23 treesize of output 16 [2018-11-28 12:25:41,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:41,019 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 1 case distinctions, treesize of input 19 treesize of output 15 [2018-11-28 12:25:41,019 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 12:25:41,029 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 16 treesize of output 9 [2018-11-28 12:25:41,029 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:41,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:25:41,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:25:41,045 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-11-28 12:25:41,073 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:41,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-28 12:25:41,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:41,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:41,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-11-28 12:25:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:41,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:41,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2018-11-28 12:25:41,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-28 12:25:41,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-28 12:25:41,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=889, Unknown=3, NotChecked=0, Total=992 [2018-11-28 12:25:41,122 INFO L87 Difference]: Start difference. First operand 126 states and 151 transitions. Second operand 32 states. [2018-11-28 12:25:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:50,140 INFO L93 Difference]: Finished difference Result 133 states and 157 transitions. [2018-11-28 12:25:50,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-28 12:25:50,140 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2018-11-28 12:25:50,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:50,140 INFO L225 Difference]: With dead ends: 133 [2018-11-28 12:25:50,140 INFO L226 Difference]: Without dead ends: 133 [2018-11-28 12:25:50,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=276, Invalid=1883, Unknown=3, NotChecked=0, Total=2162 [2018-11-28 12:25:50,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-28 12:25:50,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 122. [2018-11-28 12:25:50,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-28 12:25:50,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 146 transitions. [2018-11-28 12:25:50,143 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 146 transitions. Word has length 40 [2018-11-28 12:25:50,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:50,143 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 146 transitions. [2018-11-28 12:25:50,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-28 12:25:50,143 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 146 transitions. [2018-11-28 12:25:50,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 12:25:50,143 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:50,143 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:50,143 INFO L423 AbstractCegarLoop]: === Iteration 22 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:50,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:50,144 INFO L82 PathProgramCache]: Analyzing trace with hash -564033654, now seen corresponding path program 2 times [2018-11-28 12:25:50,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:50,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:50,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:50,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:50,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:50,181 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:50,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:50,181 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:25:50,198 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:25:50,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:25:50,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:25:50,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:50,233 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:50,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:50,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 12:25:50,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:25:50,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:25:50,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:25:50,259 INFO L87 Difference]: Start difference. First operand 122 states and 146 transitions. Second operand 7 states. [2018-11-28 12:25:50,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:50,288 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-11-28 12:25:50,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:25:50,294 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-11-28 12:25:50,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:50,295 INFO L225 Difference]: With dead ends: 84 [2018-11-28 12:25:50,295 INFO L226 Difference]: Without dead ends: 73 [2018-11-28 12:25:50,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 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:25:50,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-28 12:25:50,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-11-28 12:25:50,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-28 12:25:50,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-11-28 12:25:50,297 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 40 [2018-11-28 12:25:50,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:50,297 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-11-28 12:25:50,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:25:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-11-28 12:25:50,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 12:25:50,298 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:50,298 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:50,298 INFO L423 AbstractCegarLoop]: === Iteration 23 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:50,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:50,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1427946481, now seen corresponding path program 1 times [2018-11-28 12:25:50,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:50,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:50,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:50,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:25:50,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 12:25:50,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:50,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:25:50,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:25:50,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:25:50,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:25:50,317 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 5 states. [2018-11-28 12:25:50,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:50,362 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-11-28 12:25:50,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:25:50,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-28 12:25:50,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:50,363 INFO L225 Difference]: With dead ends: 71 [2018-11-28 12:25:50,363 INFO L226 Difference]: Without dead ends: 71 [2018-11-28 12:25:50,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:25:50,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-28 12:25:50,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-11-28 12:25:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-28 12:25:50,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2018-11-28 12:25:50,365 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 44 [2018-11-28 12:25:50,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:50,365 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2018-11-28 12:25:50,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:25:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-11-28 12:25:50,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 12:25:50,365 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:50,366 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:50,366 INFO L423 AbstractCegarLoop]: === Iteration 24 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:50,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:50,366 INFO L82 PathProgramCache]: Analyzing trace with hash 2132968081, now seen corresponding path program 1 times [2018-11-28 12:25:50,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:50,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:50,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:50,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:50,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:50,389 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 12:25:50,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:50,389 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:25:50,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:50,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 12:25:50,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:50,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-28 12:25:50,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:25:50,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:25:50,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:25:50,433 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 5 states. [2018-11-28 12:25:50,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:50,446 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-11-28 12:25:50,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:25:50,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-11-28 12:25:50,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:50,446 INFO L225 Difference]: With dead ends: 73 [2018-11-28 12:25:50,446 INFO L226 Difference]: Without dead ends: 73 [2018-11-28 12:25:50,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 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:25:50,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-28 12:25:50,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-11-28 12:25:50,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-28 12:25:50,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-11-28 12:25:50,448 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 46 [2018-11-28 12:25:50,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:50,448 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-11-28 12:25:50,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:25:50,448 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-11-28 12:25:50,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 12:25:50,448 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:50,448 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:50,448 INFO L423 AbstractCegarLoop]: === Iteration 25 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:50,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:50,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1701092898, now seen corresponding path program 1 times [2018-11-28 12:25:50,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:50,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:50,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:50,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:50,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:50,864 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:50,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:50,864 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:25:50,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:50,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:50,915 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 6 treesize of output 5 [2018-11-28 12:25:50,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:50,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:50,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-11-28 12:25:50,954 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:50,955 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:50,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 12:25:50,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:50,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:50,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-11-28 12:25:50,991 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:25:50,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-11-28 12:25:50,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:50,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:50,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:50,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-28 12:25:51,020 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 19 treesize of output 14 [2018-11-28 12:25:51,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:51,022 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 14 treesize of output 23 [2018-11-28 12:25:51,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:51,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:51,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:51,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-28 12:25:51,056 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 45 treesize of output 41 [2018-11-28 12:25:51,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 12:25:51,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:51,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:51,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:51,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-11-28 12:25:51,434 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 25 treesize of output 21 [2018-11-28 12:25:51,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-28 12:25:51,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:51,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:51,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:51,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:13 [2018-11-28 12:25:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:51,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:51,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 47 [2018-11-28 12:25:51,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-28 12:25:51,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-28 12:25:51,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2029, Unknown=0, NotChecked=0, Total=2162 [2018-11-28 12:25:51,524 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 47 states. [2018-11-28 12:25:52,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:52,941 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2018-11-28 12:25:52,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-28 12:25:52,942 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-11-28 12:25:52,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:25:52,942 INFO L225 Difference]: With dead ends: 84 [2018-11-28 12:25:52,942 INFO L226 Difference]: Without dead ends: 78 [2018-11-28 12:25:52,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=479, Invalid=4777, Unknown=0, NotChecked=0, Total=5256 [2018-11-28 12:25:52,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-28 12:25:52,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2018-11-28 12:25:52,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-28 12:25:52,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2018-11-28 12:25:52,944 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 47 [2018-11-28 12:25:52,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:25:52,945 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-11-28 12:25:52,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-28 12:25:52,945 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-11-28 12:25:52,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 12:25:52,945 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:25:52,945 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:52,945 INFO L423 AbstractCegarLoop]: === Iteration 26 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:25:52,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:52,946 INFO L82 PathProgramCache]: Analyzing trace with hash -163583187, now seen corresponding path program 1 times [2018-11-28 12:25:52,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:52,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:52,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:52,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:52,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:53,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:53,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:25:53,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:53,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:53,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:25:53,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:53,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:53,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 12:25:53,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:53,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:53,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 12:25:53,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:53,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:53,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-28 12:25:53,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, 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:25:53,461 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:25:53,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:53,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:53,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:53,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-11-28 12:25:53,492 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:25:53,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:53,494 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 27 [2018-11-28 12:25:53,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:53,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:53,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:53,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-11-28 12:25:53,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-11-28 12:25:53,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-28 12:25:53,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:53,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:53,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:53,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-11-28 12:25:54,302 WARN L180 SmtUtils]: Spent 478.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-28 12:25:54,803 WARN L180 SmtUtils]: Spent 466.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-28 12:25:54,807 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:54,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 51 [2018-11-28 12:25:54,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-28 12:25:54,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 12:25:54,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:133 [2018-11-28 12:25:55,759 WARN L180 SmtUtils]: Spent 874.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-28 12:25:55,969 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 53 [2018-11-28 12:25:55,971 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 209 treesize of output 189 [2018-11-28 12:25:55,973 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 174 treesize of output 154 [2018-11-28 12:25:55,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:55,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:55,989 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 221 treesize of output 199 [2018-11-28 12:25:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 167 [2018-11-28 12:25:55,992 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:56,003 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:56,006 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 221 treesize of output 199 [2018-11-28 12:25:56,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 168 [2018-11-28 12:25:56,008 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:56,021 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:56,070 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:56,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:56,093 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 119 [2018-11-28 12:25:56,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 155 [2018-11-28 12:25:56,108 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-28 12:25:56,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 96 [2018-11-28 12:25:56,210 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-28 12:25:56,323 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:56,325 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:56,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 87 [2018-11-28 12:25:56,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 84 [2018-11-28 12:25:56,339 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 12:25:56,360 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 12:25:56,363 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:56,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:56,366 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 79 treesize of output 83 [2018-11-28 12:25:56,371 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 73 treesize of output 66 [2018-11-28 12:25:56,372 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:56,381 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:56,476 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:56,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:56,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:56,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 106 [2018-11-28 12:25:56,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 78 [2018-11-28 12:25:56,484 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:56,495 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:56,497 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:56,498 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:56,500 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:56,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 110 [2018-11-28 12:25:56,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 93 [2018-11-28 12:25:56,507 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:56,518 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:56,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:56,599 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:56,604 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:56,607 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:56,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 129 [2018-11-28 12:25:56,620 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:56,668 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:56,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 110 [2018-11-28 12:25:56,682 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:56,722 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:56,793 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 12:25:56,853 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:56,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 80 [2018-11-28 12:25:56,861 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 12:25:56,930 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-11-28 12:25:57,057 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 8 dim-0 vars, and 10 xjuncts. [2018-11-28 12:25:57,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 82 [2018-11-28 12:25:57,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 76 [2018-11-28 12:25:57,074 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 12:25:57,099 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:57,101 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:57,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 69 [2018-11-28 12:25:57,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-11-28 12:25:57,104 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:57,111 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:57,113 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:57,116 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:57,117 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 83 treesize of output 79 [2018-11-28 12:25:57,127 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 3 case distinctions, treesize of input 92 treesize of output 84 [2018-11-28 12:25:57,128 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 3 xjuncts. [2018-11-28 12:25:57,148 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:25:57,166 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-28 12:25:57,168 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:57,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:57,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 116 [2018-11-28 12:25:57,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 51 [2018-11-28 12:25:57,185 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-11-28 12:25:57,202 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:57,203 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:57,205 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:57,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 100 [2018-11-28 12:25:57,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 78 [2018-11-28 12:25:57,210 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:57,219 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:57,221 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:57,222 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:57,224 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:57,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 104 [2018-11-28 12:25:57,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 93 [2018-11-28 12:25:57,229 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:57,237 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:25:57,258 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 12:25:57,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 29 dim-0 vars, and 15 xjuncts. [2018-11-28 12:25:57,448 INFO L202 ElimStorePlain]: Needed 36 recursive calls to eliminate 8 variables, input treesize:539, output treesize:1212 [2018-11-28 12:25:57,787 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 71 [2018-11-28 12:25:57,972 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:57,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 54 [2018-11-28 12:25:57,975 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 26 treesize of output 14 [2018-11-28 12:25:57,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:57,985 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:57,986 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 20 treesize of output 12 [2018-11-28 12:25:57,986 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:57,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:58,011 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:58,012 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:58,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 63 [2018-11-28 12:25:58,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-28 12:25:58,018 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:58,027 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 24 treesize of output 10 [2018-11-28 12:25:58,027 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:58,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-28 12:25:58,033 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:58,036 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:58,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 41 [2018-11-28 12:25:58,054 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:25:58,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-11-28 12:25:58,054 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:58,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-28 12:25:58,060 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 12:25:58,063 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:25:58,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-28 12:25:58,074 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 9 variables, input treesize:190, output treesize:43 [2018-11-28 12:25:58,129 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:58,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:58,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 43 [2018-11-28 12:25:58,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-28 12:25:58,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-28 12:25:58,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1770, Unknown=0, NotChecked=0, Total=1892 [2018-11-28 12:25:58,145 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 44 states. [2018-11-28 12:25:59,184 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2018-11-28 12:25:59,840 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 92 [2018-11-28 12:26:00,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:00,424 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-11-28 12:26:00,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-28 12:26:00,424 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 48 [2018-11-28 12:26:00,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:00,425 INFO L225 Difference]: With dead ends: 92 [2018-11-28 12:26:00,425 INFO L226 Difference]: Without dead ends: 92 [2018-11-28 12:26:00,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=308, Invalid=3598, Unknown=0, NotChecked=0, Total=3906 [2018-11-28 12:26:00,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-28 12:26:00,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2018-11-28 12:26:00,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 12:26:00,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-28 12:26:00,428 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 48 [2018-11-28 12:26:00,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:00,428 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-28 12:26:00,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-28 12:26:00,428 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-28 12:26:00,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 12:26:00,428 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:00,429 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:26:00,429 INFO L423 AbstractCegarLoop]: === Iteration 27 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:26:00,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:00,429 INFO L82 PathProgramCache]: Analyzing trace with hash -163583186, now seen corresponding path program 1 times [2018-11-28 12:26:00,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:00,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:00,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:00,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:00,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:00,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:26:00,854 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:26:00,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:00,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:26:00,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:26:00,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:00,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:00,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:26:00,919 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:00,919 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:00,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 12:26:00,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:00,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:00,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-28 12:26:00,939 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:26:00,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 12:26:00,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:00,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:00,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:00,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-11-28 12:26:00,975 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:26:00,977 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:00,977 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:26:00,978 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 36 [2018-11-28 12:26:00,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:00,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:00,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:00,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-11-28 12:26:01,010 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:26:01,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:26:01,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:01,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-11-28 12:26:01,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:26:01,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:26:01,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 22 [2018-11-28 12:26:01,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-28 12:26:01,287 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,288 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,292 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:47 [2018-11-28 12:26:01,330 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 89 treesize of output 79 [2018-11-28 12:26:01,332 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 79 treesize of output 69 [2018-11-28 12:26:01,332 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:01,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:01,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 76 [2018-11-28 12:26:01,361 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:01,361 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 64 treesize of output 50 [2018-11-28 12:26:01,361 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,396 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:01,397 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:01,397 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:01,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 69 [2018-11-28 12:26:01,400 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,430 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:01,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:01,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:01,432 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:01,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:01,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 66 [2018-11-28 12:26:01,437 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,458 INFO L267 ElimStorePlain]: Start of recursive call 4: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,462 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:103, output treesize:26 [2018-11-28 12:26:01,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-28 12:26:01,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-28 12:26:01,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-11-28 12:26:01,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-11-28 12:26:01,571 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,573 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:01,576 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2018-11-28 12:26:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:01,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:26:01,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 42 [2018-11-28 12:26:01,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-28 12:26:01,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-28 12:26:01,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1699, Unknown=0, NotChecked=0, Total=1806 [2018-11-28 12:26:01,626 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 43 states. [2018-11-28 12:26:03,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:03,082 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2018-11-28 12:26:03,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-28 12:26:03,083 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 48 [2018-11-28 12:26:03,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:03,083 INFO L225 Difference]: With dead ends: 102 [2018-11-28 12:26:03,083 INFO L226 Difference]: Without dead ends: 102 [2018-11-28 12:26:03,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=340, Invalid=3950, Unknown=0, NotChecked=0, Total=4290 [2018-11-28 12:26:03,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-28 12:26:03,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 88. [2018-11-28 12:26:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-28 12:26:03,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-11-28 12:26:03,086 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 48 [2018-11-28 12:26:03,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:03,086 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-11-28 12:26:03,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-28 12:26:03,086 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-11-28 12:26:03,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 12:26:03,086 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:03,086 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] [2018-11-28 12:26:03,086 INFO L423 AbstractCegarLoop]: === Iteration 28 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:26:03,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:03,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1481141252, now seen corresponding path program 1 times [2018-11-28 12:26:03,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:03,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:03,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:03,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:03,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:04,131 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:04,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:26:04,131 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:26:04,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:04,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:26:04,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:26:04,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:26:04,273 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:26:04,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 12:26:04,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,284 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:26:04,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 12:26:04,285 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,287 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,293 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-11-28 12:26:04,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-28 12:26:04,335 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:04,336 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 27 [2018-11-28 12:26:04,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-28 12:26:04,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:04,354 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 27 [2018-11-28 12:26:04,354 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,358 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,366 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2018-11-28 12:26:04,514 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:04,518 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 34 treesize of output 35 [2018-11-28 12:26:04,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-28 12:26:04,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,538 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:04,541 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 34 treesize of output 35 [2018-11-28 12:26:04,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-28 12:26:04,543 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,547 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,557 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:92, output treesize:62 [2018-11-28 12:26:04,610 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:04,614 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 33 [2018-11-28 12:26:04,616 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:26:04,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,643 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:04,647 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 45 [2018-11-28 12:26:04,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 12:26:04,650 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,674 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:88, output treesize:92 [2018-11-28 12:26:04,759 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:04,766 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 71 treesize of output 66 [2018-11-28 12:26:04,770 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:04,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 57 [2018-11-28 12:26:04,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,827 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:04,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 58 [2018-11-28 12:26:04,833 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:04,834 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:26:04,834 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 36 [2018-11-28 12:26:04,835 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,846 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,873 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:118, output treesize:110 [2018-11-28 12:26:04,955 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:04,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:04,960 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 145 treesize of output 144 [2018-11-28 12:26:04,963 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:04,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 53 [2018-11-28 12:26:04,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:04,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:05,001 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:05,002 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:26:05,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2018-11-28 12:26:05,006 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:05,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2018-11-28 12:26:05,007 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:05,018 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:05,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:05,034 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:175, output treesize:125 [2018-11-28 12:26:05,259 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:05,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:05,261 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:05,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-11-28 12:26:05,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:05,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:05,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:133, output treesize:127 [2018-11-28 12:26:05,773 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:05,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 458 treesize of output 332 [2018-11-28 12:26:05,784 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:05,788 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:05,790 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:26:05,810 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 193 [2018-11-28 12:26:05,811 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 12:26:05,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:05,893 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:05,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:05,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 376 treesize of output 319 [2018-11-28 12:26:05,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 373 treesize of output 324 [2018-11-28 12:26:05,906 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:05,939 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:26:05,943 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:05,952 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:05,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 378 treesize of output 323 [2018-11-28 12:26:05,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 351 treesize of output 304 [2018-11-28 12:26:05,959 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:05,986 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:26:05,990 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:05,993 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:05,998 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:06,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 401 treesize of output 328 [2018-11-28 12:26:06,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 394 treesize of output 341 [2018-11-28 12:26:06,005 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:06,035 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:06,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-28 12:26:07,010 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:07,017 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:26:07,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 304 treesize of output 255 [2018-11-28 12:26:07,021 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:07,022 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:26:07,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 79 [2018-11-28 12:26:07,023 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:07,047 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:07,051 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:07,055 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:26:07,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 213 [2018-11-28 12:26:07,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 151 [2018-11-28 12:26:07,059 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:07,077 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:07,092 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:07,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:07,107 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:26:07,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 306 treesize of output 257 [2018-11-28 12:26:07,112 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:07,113 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:26:07,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 79 [2018-11-28 12:26:07,114 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:07,141 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:07,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:07,147 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:26:07,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 216 treesize of output 220 [2018-11-28 12:26:07,150 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 187 treesize of output 156 [2018-11-28 12:26:07,150 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:07,169 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:07,184 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:07,187 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:07,194 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:26:07,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 323 treesize of output 274 [2018-11-28 12:26:07,199 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:07,201 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:07,201 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:26:07,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 87 [2018-11-28 12:26:07,202 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:07,236 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:07,237 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:07,242 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:26:07,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 230 [2018-11-28 12:26:07,247 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 197 treesize of output 166 [2018-11-28 12:26:07,247 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:07,274 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:07,293 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:07,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-11-28 12:26:07,359 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 3 variables, input treesize:481, output treesize:499 [2018-11-28 12:26:10,087 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 173 [2018-11-28 12:26:10,094 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:26:10,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2018-11-28 12:26:10,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,123 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,124 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:26:10,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-11-28 12:26:10,124 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2018-11-28 12:26:10,145 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:10,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:10,213 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 176 [2018-11-28 12:26:10,227 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,228 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:26:10,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-11-28 12:26:10,229 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-11-28 12:26:10,282 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,313 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,314 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:26:10,315 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 34 treesize of output 27 [2018-11-28 12:26:10,315 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,355 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,393 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,394 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 89 [2018-11-28 12:26:10,399 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 16 treesize of output 8 [2018-11-28 12:26:10,399 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,413 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 39 [2018-11-28 12:26:10,420 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-28 12:26:10,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2018-11-28 12:26:10,434 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,439 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 80 [2018-11-28 12:26:10,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-11-28 12:26:10,465 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,478 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:26:10,478 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 30 treesize of output 19 [2018-11-28 12:26:10,479 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,490 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:10,490 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 22 treesize of output 12 [2018-11-28 12:26:10,491 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,497 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:10,509 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 11 variables, input treesize:385, output treesize:7 [2018-11-28 12:26:10,574 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:10,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:26:10,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 56 [2018-11-28 12:26:10,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-28 12:26:10,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-28 12:26:10,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2914, Unknown=1, NotChecked=0, Total=3080 [2018-11-28 12:26:10,591 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 56 states. [2018-11-28 12:26:12,289 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2018-11-28 12:26:13,080 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 113 [2018-11-28 12:26:13,770 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 98 [2018-11-28 12:26:14,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:14,140 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2018-11-28 12:26:14,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-28 12:26:14,140 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 51 [2018-11-28 12:26:14,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:14,141 INFO L225 Difference]: With dead ends: 92 [2018-11-28 12:26:14,141 INFO L226 Difference]: Without dead ends: 92 [2018-11-28 12:26:14,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1659 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=439, Invalid=6532, Unknown=1, NotChecked=0, Total=6972 [2018-11-28 12:26:14,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-28 12:26:14,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2018-11-28 12:26:14,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-28 12:26:14,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-11-28 12:26:14,144 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 51 [2018-11-28 12:26:14,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:14,144 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-11-28 12:26:14,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-28 12:26:14,144 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-28 12:26:14,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 12:26:14,144 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:14,144 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] [2018-11-28 12:26:14,144 INFO L423 AbstractCegarLoop]: === Iteration 29 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:26:14,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:14,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1329256457, now seen corresponding path program 1 times [2018-11-28 12:26:14,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:14,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:14,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:14,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:14,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:14,481 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:14,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:26:14,482 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:26:14,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:14,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:26:14,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:26:14,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:14,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:14,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 12:26:14,620 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:14,621 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:14,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 12:26:14,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:14,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:14,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-11-28 12:26:14,649 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:26:14,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 12:26:14,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:14,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:14,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:14,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-11-28 12:26:14,678 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:26:14,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:14,679 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:26:14,680 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 36 [2018-11-28 12:26:14,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:14,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:14,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:14,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-11-28 12:26:14,719 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:26:14,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:26:14,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:14,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:14,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:14,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-11-28 12:26:14,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 22 [2018-11-28 12:26:14,928 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 22 treesize of output 21 [2018-11-28 12:26:14,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:14,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:14,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:14,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-28 12:26:14,955 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 52 treesize of output 44 [2018-11-28 12:26:14,957 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 44 treesize of output 36 [2018-11-28 12:26:14,957 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:14,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:14,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2018-11-28 12:26:14,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-11-28 12:26:14,981 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:15,008 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:15,008 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:26:15,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-11-28 12:26:15,009 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:15,032 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:15,033 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:15,034 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:26:15,035 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:15,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 45 [2018-11-28 12:26:15,036 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:15,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:15,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-28 12:26:15,064 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:15,070 INFO L267 ElimStorePlain]: Start of recursive call 4: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:15,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:15,073 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:69, output treesize:11 [2018-11-28 12:26:15,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 12:26:15,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 12:26:15,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:15,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:15,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:15,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-28 12:26:15,146 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:15,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:26:15,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 39 [2018-11-28 12:26:15,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-28 12:26:15,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-28 12:26:15,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2018-11-28 12:26:15,162 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 40 states. [2018-11-28 12:26:16,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:16,506 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-11-28 12:26:16,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-28 12:26:16,506 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 52 [2018-11-28 12:26:16,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:16,506 INFO L225 Difference]: With dead ends: 116 [2018-11-28 12:26:16,506 INFO L226 Difference]: Without dead ends: 116 [2018-11-28 12:26:16,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1191 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=483, Invalid=4487, Unknown=0, NotChecked=0, Total=4970 [2018-11-28 12:26:16,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-28 12:26:16,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2018-11-28 12:26:16,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-28 12:26:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2018-11-28 12:26:16,510 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 52 [2018-11-28 12:26:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:16,510 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2018-11-28 12:26:16,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-28 12:26:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2018-11-28 12:26:16,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 12:26:16,510 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:16,511 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:26:16,511 INFO L423 AbstractCegarLoop]: === Iteration 30 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:26:16,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:16,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1810166342, now seen corresponding path program 1 times [2018-11-28 12:26:16,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:16,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:16,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:16,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:16,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:17,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:26:17,234 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:26:17,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:17,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:26:17,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:26:17,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:17,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 12:26:17,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:17,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:17,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-28 12:26:17,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:17,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:17,352 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:17,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 12:26:17,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:17,360 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:17,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-28 12:26:17,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-11-28 12:26:17,365 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:17,372 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:17,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:17,379 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 [2018-11-28 12:26:17,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:26:17,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:26:17,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:17,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:17,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 12:26:17,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:26:17,507 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:17,508 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:17,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:17,515 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:49, output treesize:35 [2018-11-28 12:26:17,551 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:17,551 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:17,552 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:17,552 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:17,555 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:17,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 78 [2018-11-28 12:26:17,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2018-11-28 12:26:17,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:26:17,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:45 [2018-11-28 12:26:17,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-11-28 12:26:17,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-28 12:26:17,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:17,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:17,739 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 24 [2018-11-28 12:26:17,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-28 12:26:17,740 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:17,743 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:17,750 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 17 treesize of output 15 [2018-11-28 12:26:17,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 12:26:17,751 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:17,753 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:17,760 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 16 [2018-11-28 12:26:17,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 12:26:17,761 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:17,765 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:17,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:26:17,772 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:58, output treesize:22 [2018-11-28 12:26:17,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:17,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:26:17,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:17,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:17,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-11-28 12:26:17,863 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:17,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:26:17,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 18] total 40 [2018-11-28 12:26:17,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-28 12:26:17,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-28 12:26:17,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1516, Unknown=0, NotChecked=0, Total=1640 [2018-11-28 12:26:17,878 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand 41 states. [2018-11-28 12:26:27,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:27,009 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2018-11-28 12:26:27,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-28 12:26:27,009 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 54 [2018-11-28 12:26:27,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:27,009 INFO L225 Difference]: With dead ends: 129 [2018-11-28 12:26:27,010 INFO L226 Difference]: Without dead ends: 129 [2018-11-28 12:26:27,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=604, Invalid=4083, Unknown=5, NotChecked=0, Total=4692 [2018-11-28 12:26:27,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-28 12:26:27,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 119. [2018-11-28 12:26:27,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-28 12:26:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 136 transitions. [2018-11-28 12:26:27,015 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 136 transitions. Word has length 54 [2018-11-28 12:26:27,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:27,015 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 136 transitions. [2018-11-28 12:26:27,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-28 12:26:27,015 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 136 transitions. [2018-11-28 12:26:27,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-28 12:26:27,016 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:27,016 INFO L402 BasicCegarLoop]: trace histogram [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:26:27,016 INFO L423 AbstractCegarLoop]: === Iteration 31 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:26:27,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:27,016 INFO L82 PathProgramCache]: Analyzing trace with hash 425878579, now seen corresponding path program 1 times [2018-11-28 12:26:27,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:27,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:27,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:27,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:27,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:27,980 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:26:27,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:26:27,980 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:26:27,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:28,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:26:28,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:28,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:28,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:23 [2018-11-28 12:26:28,079 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:26:28,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 12:26:28,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:28,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:28,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:28,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-11-28 12:26:28,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-28 12:26:28,122 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:28,123 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 27 [2018-11-28 12:26:28,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:28,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:28,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:28,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-11-28 12:26:28,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:28,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 79 [2018-11-28 12:26:28,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-28 12:26:28,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:28,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:28,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:28,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:65 [2018-11-28 12:26:28,785 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 165 treesize of output 162 [2018-11-28 12:26:28,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:26:28,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:28,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:28,828 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 179 treesize of output 176 [2018-11-28 12:26:28,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:26:28,831 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:28,839 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:26:28,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:26:28,864 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:345, output treesize:351 [2018-11-28 12:26:29,112 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2018-11-28 12:26:29,114 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:29,115 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:29,117 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:29,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 261 treesize of output 211 [2018-11-28 12:26:29,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 67 [2018-11-28 12:26:29,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 12:26:29,166 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:29,167 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:29,168 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:29,174 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:29,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 189 [2018-11-28 12:26:29,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 180 [2018-11-28 12:26:29,178 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:29,194 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:26:29,196 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:29,197 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:29,198 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:29,204 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:29,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 189 [2018-11-28 12:26:29,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 161 [2018-11-28 12:26:29,208 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:29,224 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:26:29,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 12:26:29,341 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 156 treesize of output 140 [2018-11-28 12:26:29,343 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 132 treesize of output 116 [2018-11-28 12:26:29,343 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:29,357 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:29,359 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 148 treesize of output 134 [2018-11-28 12:26:29,361 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 115 treesize of output 101 [2018-11-28 12:26:29,361 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:29,376 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:29,468 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 251 treesize of output 231 [2018-11-28 12:26:29,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 195 [2018-11-28 12:26:29,470 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:29,488 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:29,578 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:29,579 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:29,580 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:29,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 173 [2018-11-28 12:26:29,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 59 [2018-11-28 12:26:29,597 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-28 12:26:29,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:29,626 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:29,627 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:29,629 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:29,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 143 [2018-11-28 12:26:29,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 130 [2018-11-28 12:26:29,636 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:29,650 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:29,652 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:29,653 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:29,654 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:29,657 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:29,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 143 [2018-11-28 12:26:29,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 115 [2018-11-28 12:26:29,664 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:29,677 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:29,710 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 12:26:29,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-11-28 12:26:29,821 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 6 variables, input treesize:611, output treesize:463 [2018-11-28 12:26:30,141 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:30,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:30,143 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:26:30,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 109 [2018-11-28 12:26:30,148 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 31 treesize of output 23 [2018-11-28 12:26:30,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:30,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-28 12:26:30,160 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:30,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 47 [2018-11-28 12:26:30,168 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:30,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:26:30,182 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 7 treesize of output 5 [2018-11-28 12:26:30,183 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 12:26:30,189 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:26:30,189 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:120, output treesize:44 [2018-11-28 12:26:40,853 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:26:40,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:26:40,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 53 [2018-11-28 12:26:40,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-28 12:26:40,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-28 12:26:40,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2692, Unknown=8, NotChecked=0, Total=2862 [2018-11-28 12:26:40,869 INFO L87 Difference]: Start difference. First operand 119 states and 136 transitions. Second operand 54 states. [2018-11-28 12:26:56,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:56,392 INFO L93 Difference]: Finished difference Result 127 states and 144 transitions. [2018-11-28 12:26:56,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-28 12:26:56,393 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 61 [2018-11-28 12:26:56,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:56,394 INFO L225 Difference]: With dead ends: 127 [2018-11-28 12:26:56,394 INFO L226 Difference]: Without dead ends: 124 [2018-11-28 12:26:56,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=333, Invalid=4915, Unknown=8, NotChecked=0, Total=5256 [2018-11-28 12:26:56,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-28 12:26:56,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2018-11-28 12:26:56,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-28 12:26:56,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 138 transitions. [2018-11-28 12:26:56,398 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 138 transitions. Word has length 61 [2018-11-28 12:26:56,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:56,398 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 138 transitions. [2018-11-28 12:26:56,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-28 12:26:56,398 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 138 transitions. [2018-11-28 12:26:56,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-28 12:26:56,399 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:26:56,399 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:26:56,399 INFO L423 AbstractCegarLoop]: === Iteration 32 === [dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-11-28 12:26:56,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:26:56,399 INFO L82 PathProgramCache]: Analyzing trace with hash 320925888, now seen corresponding path program 1 times [2018-11-28 12:26:56,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:26:56,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:26:56,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:56,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:26:56,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:26:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:26:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-28 12:26:56,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:26:56,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:26:56,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:26:56,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:26:56,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:26:56,428 INFO L87 Difference]: Start difference. First operand 121 states and 138 transitions. Second operand 6 states. [2018-11-28 12:26:56,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:26:56,451 INFO L93 Difference]: Finished difference Result 58 states and 57 transitions. [2018-11-28 12:26:56,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:26:56,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-11-28 12:26:56,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:26:56,452 INFO L225 Difference]: With dead ends: 58 [2018-11-28 12:26:56,452 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 12:26:56,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:26:56,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 12:26:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 12:26:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 12:26:56,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 12:26:56,452 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2018-11-28 12:26:56,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:26:56,453 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:26:56,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:26:56,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:26:56,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 12:26:56,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:26:56 BoogieIcfgContainer [2018-11-28 12:26:56,460 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:26:56,460 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:26:56,460 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:26:56,461 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:26:56,461 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:07" (3/4) ... [2018-11-28 12:26:56,471 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 12:26:56,475 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 12:26:56,475 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-11-28 12:26:56,475 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_create [2018-11-28 12:26:56,475 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-28 12:26:56,476 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-28 12:26:56,476 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 12:26:56,476 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-11-28 12:26:56,476 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_remove_first [2018-11-28 12:26:56,479 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-28 12:26:56,479 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-28 12:26:56,480 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 12:26:56,509 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_cdd96ae7-1c33-4199-98dd-c6a1a1a3e7c5/bin-2019/uautomizer/witness.graphml [2018-11-28 12:26:56,509 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:26:56,510 INFO L168 Benchmark]: Toolchain (without parser) took 109774.05 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 296.7 MB). Free memory was 950.6 MB in the beginning and 844.2 MB in the end (delta: 106.5 MB). Peak memory consumption was 403.2 MB. Max. memory is 11.5 GB. [2018-11-28 12:26:56,510 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:26:56,510 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-28 12:26:56,510 INFO L168 Benchmark]: Boogie Preprocessor took 40.73 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.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-28 12:26:56,511 INFO L168 Benchmark]: RCFGBuilder took 421.76 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: 59.9 MB). Peak memory consumption was 59.9 MB. Max. memory is 11.5 GB. [2018-11-28 12:26:56,511 INFO L168 Benchmark]: TraceAbstraction took 108913.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.9 MB). Free memory was 1.1 GB in the beginning and 844.2 MB in the end (delta: 224.4 MB). Peak memory consumption was 373.3 MB. Max. memory is 11.5 GB. [2018-11-28 12:26:56,511 INFO L168 Benchmark]: Witness Printer took 48.80 ms. Allocated memory is still 1.3 GB. Free memory was 844.2 MB in the beginning and 844.2 MB in the end (delta: 18.6 kB). Peak memory consumption was 18.6 kB. Max. memory is 11.5 GB. [2018-11-28 12:26:56,512 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.73 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.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 421.76 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: 59.9 MB). Peak memory consumption was 59.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 108913.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.9 MB). Free memory was 1.1 GB in the beginning and 844.2 MB in the end (delta: 224.4 MB). Peak memory consumption was 373.3 MB. Max. memory is 11.5 GB. * Witness Printer took 48.80 ms. Allocated memory is still 1.3 GB. Free memory was 844.2 MB in the beginning and 844.2 MB in the end (delta: 18.6 kB). Peak memory consumption was 18.6 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 585]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 585]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: 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: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 598]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: 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: 593]: 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: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: free always succeeds For all program executions holds that free 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 - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 91 locations, 29 error locations. SAFE Result, 108.8s OverallTime, 32 OverallIterations, 3 TraceHistogramMax, 68.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1253 SDtfs, 2725 SDslu, 7750 SDs, 0 SdLazy, 16743 SolverSat, 648 SolverUnsat, 36 SolverUnknown, 0 SolverNotchecked, 45.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1444 GetRequests, 579 SyntacticMatches, 43 SemanticMatches, 822 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9111 ImplicationChecksByTransitivity, 51.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 262 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 38.3s InterpolantComputationTime, 1894 NumberOfCodeBlocks, 1894 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 1843 ConstructedInterpolants, 203 QuantifiedInterpolants, 1612681 SizeOfPredicates, 259 NumberOfNonLiveVariables, 4343 ConjunctsInSsa, 833 ConjunctsInUnsatCore, 51 InterpolantComputations, 13 PerfectInterpolantSequences, 180/554 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...