java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-simple/sll2n_prepend_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:13:03,174 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:13:03,177 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:13:03,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:13:03,195 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:13:03,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:13:03,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:13:03,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:13:03,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:13:03,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:13:03,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:13:03,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:13:03,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:13:03,218 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:13:03,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:13:03,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:13:03,223 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:13:03,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:13:03,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:13:03,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:13:03,235 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:13:03,238 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:13:03,240 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:13:03,241 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:13:03,243 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:13:03,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:13:03,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:13:03,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:13:03,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:13:03,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:13:03,248 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:13:03,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:13:03,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:13:03,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:13:03,251 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:13:03,251 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:13:03,252 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:13:03,252 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:13:03,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:13:03,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:13:03,254 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:13:03,255 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:13:03,284 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:13:03,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:13:03,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:13:03,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:13:03,287 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:13:03,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:13:03,288 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:13:03,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:13:03,288 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:13:03,288 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:13:03,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:13:03,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:13:03,289 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:13:03,290 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:13:03,290 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:13:03,290 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:13:03,290 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:13:03,291 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:13:03,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:13:03,291 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:13:03,291 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:13:03,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:13:03,292 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:13:03,292 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:13:03,292 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:13:03,292 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:13:03,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:13:03,293 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:13:03,293 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:13:03,554 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:13:03,572 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:13:03,576 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:13:03,577 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:13:03,577 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:13:03,578 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_prepend_equal.i [2019-10-14 23:13:03,652 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86322e7a1/8b47568a5b1b467cb26146354e12b865/FLAG77798850f [2019-10-14 23:13:04,150 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:13:04,151 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_prepend_equal.i [2019-10-14 23:13:04,172 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86322e7a1/8b47568a5b1b467cb26146354e12b865/FLAG77798850f [2019-10-14 23:13:04,448 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86322e7a1/8b47568a5b1b467cb26146354e12b865 [2019-10-14 23:13:04,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:13:04,461 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:13:04,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:13:04,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:13:04,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:13:04,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:13:04" (1/1) ... [2019-10-14 23:13:04,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51638eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:04, skipping insertion in model container [2019-10-14 23:13:04,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:13:04" (1/1) ... [2019-10-14 23:13:04,477 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:13:04,538 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:13:05,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:13:05,024 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:13:05,084 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:13:05,136 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:13:05,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:05 WrapperNode [2019-10-14 23:13:05,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:13:05,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:13:05,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:13:05,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:13:05,149 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:05" (1/1) ... [2019-10-14 23:13:05,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:05" (1/1) ... [2019-10-14 23:13:05,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:05" (1/1) ... [2019-10-14 23:13:05,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:05" (1/1) ... [2019-10-14 23:13:05,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:05" (1/1) ... [2019-10-14 23:13:05,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:05" (1/1) ... [2019-10-14 23:13:05,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:05" (1/1) ... [2019-10-14 23:13:05,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:13:05,198 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:13:05,198 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:13:05,198 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:13:05,199 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-10-14 23:13:05,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:13:05,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:13:05,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-14 23:13:05,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-14 23:13:05,267 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-14 23:13:05,267 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-10-14 23:13:05,267 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-10-14 23:13:05,267 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2019-10-14 23:13:05,267 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_prepend [2019-10-14 23:13:05,267 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:13:05,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:13:05,268 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-14 23:13:05,268 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-14 23:13:05,268 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 23:13:05,268 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 23:13:05,268 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 23:13:05,269 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 23:13:05,269 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 23:13:05,269 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 23:13:05,269 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 23:13:05,269 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 23:13:05,269 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 23:13:05,270 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 23:13:05,270 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 23:13:05,270 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 23:13:05,270 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 23:13:05,270 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 23:13:05,270 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 23:13:05,271 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 23:13:05,271 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 23:13:05,271 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 23:13:05,271 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 23:13:05,271 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 23:13:05,271 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 23:13:05,272 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 23:13:05,272 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 23:13:05,272 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 23:13:05,272 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 23:13:05,272 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 23:13:05,272 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 23:13:05,272 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 23:13:05,273 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 23:13:05,273 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 23:13:05,273 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 23:13:05,273 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 23:13:05,273 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 23:13:05,273 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 23:13:05,274 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 23:13:05,274 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 23:13:05,274 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 23:13:05,274 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 23:13:05,274 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 23:13:05,274 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 23:13:05,274 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 23:13:05,275 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 23:13:05,275 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 23:13:05,275 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 23:13:05,275 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 23:13:05,275 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 23:13:05,275 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 23:13:05,275 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 23:13:05,276 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 23:13:05,276 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 23:13:05,276 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 23:13:05,276 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 23:13:05,276 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 23:13:05,276 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 23:13:05,277 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-14 23:13:05,277 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 23:13:05,277 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 23:13:05,277 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 23:13:05,277 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 23:13:05,277 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 23:13:05,278 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 23:13:05,278 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 23:13:05,278 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 23:13:05,278 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 23:13:05,278 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 23:13:05,278 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 23:13:05,278 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 23:13:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 23:13:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 23:13:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 23:13:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 23:13:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 23:13:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 23:13:05,280 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 23:13:05,280 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 23:13:05,280 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 23:13:05,280 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 23:13:05,280 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 23:13:05,280 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 23:13:05,281 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 23:13:05,281 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 23:13:05,281 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 23:13:05,281 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 23:13:05,281 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 23:13:05,281 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 23:13:05,281 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 23:13:05,282 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 23:13:05,282 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 23:13:05,282 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 23:13:05,282 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 23:13:05,282 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 23:13:05,282 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 23:13:05,282 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 23:13:05,283 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 23:13:05,283 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 23:13:05,283 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 23:13:05,283 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 23:13:05,283 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 23:13:05,283 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 23:13:05,283 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 23:13:05,283 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 23:13:05,284 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 23:13:05,284 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 23:13:05,284 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-14 23:13:05,284 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-10-14 23:13:05,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 23:13:05,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 23:13:05,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:13:05,285 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-10-14 23:13:05,285 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2019-10-14 23:13:05,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 23:13:05,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:13:05,285 INFO L130 BoogieDeclarations]: Found specification of procedure sll_prepend [2019-10-14 23:13:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:13:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-14 23:13:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-14 23:13:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:13:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:13:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:13:05,662 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-14 23:13:05,839 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:13:05,839 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-14 23:13:05,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:13:05 BoogieIcfgContainer [2019-10-14 23:13:05,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:13:05,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:13:05,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:13:05,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:13:05,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:13:04" (1/3) ... [2019-10-14 23:13:05,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0ccc85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:13:05, skipping insertion in model container [2019-10-14 23:13:05,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:05" (2/3) ... [2019-10-14 23:13:05,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0ccc85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:13:05, skipping insertion in model container [2019-10-14 23:13:05,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:13:05" (3/3) ... [2019-10-14 23:13:05,850 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2019-10-14 23:13:05,860 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:13:05,868 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:13:05,877 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:13:05,899 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:13:05,899 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:13:05,899 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:13:05,900 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:13:05,900 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:13:05,900 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:13:05,900 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:13:05,900 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:13:05,916 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2019-10-14 23:13:05,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:13:05,923 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:05,924 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:05,925 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:05,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:05,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1741018156, now seen corresponding path program 1 times [2019-10-14 23:13:05,939 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:05,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332843108] [2019-10-14 23:13:05,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:05,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:05,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:06,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:06,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332843108] [2019-10-14 23:13:06,224 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:06,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:13:06,225 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193484229] [2019-10-14 23:13:06,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:13:06,230 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:06,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:13:06,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:13:06,245 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 4 states. [2019-10-14 23:13:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:06,471 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2019-10-14 23:13:06,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:06,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-10-14 23:13:06,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:06,481 INFO L225 Difference]: With dead ends: 88 [2019-10-14 23:13:06,481 INFO L226 Difference]: Without dead ends: 38 [2019-10-14 23:13:06,485 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:13:06,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-14 23:13:06,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2019-10-14 23:13:06,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-14 23:13:06,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-10-14 23:13:06,548 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 28 [2019-10-14 23:13:06,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:06,548 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-10-14 23:13:06,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:13:06,549 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-10-14 23:13:06,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:13:06,553 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:06,553 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:06,554 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:06,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:06,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1529575644, now seen corresponding path program 1 times [2019-10-14 23:13:06,555 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:06,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422874153] [2019-10-14 23:13:06,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:06,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:06,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:06,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422874153] [2019-10-14 23:13:06,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:06,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:13:06,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066663795] [2019-10-14 23:13:06,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:13:06,774 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:06,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:13:06,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:13:06,775 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 7 states. [2019-10-14 23:13:06,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:06,954 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2019-10-14 23:13:06,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:13:06,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-10-14 23:13:06,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:06,955 INFO L225 Difference]: With dead ends: 58 [2019-10-14 23:13:06,956 INFO L226 Difference]: Without dead ends: 37 [2019-10-14 23:13:06,957 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:13:06,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-14 23:13:06,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2019-10-14 23:13:06,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-14 23:13:06,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-10-14 23:13:06,965 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 28 [2019-10-14 23:13:06,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:06,966 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-10-14 23:13:06,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:13:06,966 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-10-14 23:13:06,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-14 23:13:06,967 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:06,967 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 23:13:06,968 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:06,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:06,968 INFO L82 PathProgramCache]: Analyzing trace with hash -937541417, now seen corresponding path program 1 times [2019-10-14 23:13:06,968 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:06,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237529157] [2019-10-14 23:13:06,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:06,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:06,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-14 23:13:07,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237529157] [2019-10-14 23:13:07,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404664413] [2019-10-14 23:13:07,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:13:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:07,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 23:13:07,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:13:07,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:07,397 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:13:07,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-10-14 23:13:07,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255939669] [2019-10-14 23:13:07,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:13:07,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:07,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:13:07,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:13:07,399 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 9 states. [2019-10-14 23:13:07,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:07,612 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2019-10-14 23:13:07,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:13:07,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-10-14 23:13:07,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:07,614 INFO L225 Difference]: With dead ends: 62 [2019-10-14 23:13:07,614 INFO L226 Difference]: Without dead ends: 41 [2019-10-14 23:13:07,615 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:13:07,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-14 23:13:07,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-10-14 23:13:07,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-14 23:13:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-10-14 23:13:07,623 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 37 [2019-10-14 23:13:07,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:07,623 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-10-14 23:13:07,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:13:07,624 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-10-14 23:13:07,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-14 23:13:07,625 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:07,626 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-14 23:13:07,829 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:13:07,830 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:07,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:07,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1717388092, now seen corresponding path program 2 times [2019-10-14 23:13:07,831 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:07,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531655971] [2019-10-14 23:13:07,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:07,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:07,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:08,264 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-14 23:13:08,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531655971] [2019-10-14 23:13:08,265 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:08,265 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-14 23:13:08,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703069159] [2019-10-14 23:13:08,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-14 23:13:08,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:08,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-14 23:13:08,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:13:08,267 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 13 states. [2019-10-14 23:13:08,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:08,746 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-10-14 23:13:08,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:13:08,746 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2019-10-14 23:13:08,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:08,748 INFO L225 Difference]: With dead ends: 45 [2019-10-14 23:13:08,748 INFO L226 Difference]: Without dead ends: 43 [2019-10-14 23:13:08,749 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:13:08,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-14 23:13:08,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-10-14 23:13:08,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-14 23:13:08,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-10-14 23:13:08,756 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 46 [2019-10-14 23:13:08,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:08,758 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-10-14 23:13:08,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-14 23:13:08,759 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-10-14 23:13:08,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-14 23:13:08,762 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:08,762 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-14 23:13:08,762 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:08,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:08,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1717386418, now seen corresponding path program 1 times [2019-10-14 23:13:08,763 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:08,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591208152] [2019-10-14 23:13:08,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:08,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:08,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:08,959 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-14 23:13:08,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591208152] [2019-10-14 23:13:08,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:08,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-14 23:13:08,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706858852] [2019-10-14 23:13:08,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 23:13:08,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:08,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 23:13:08,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:13:08,962 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 11 states. [2019-10-14 23:13:09,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:09,187 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-10-14 23:13:09,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 23:13:09,187 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2019-10-14 23:13:09,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:09,189 INFO L225 Difference]: With dead ends: 43 [2019-10-14 23:13:09,189 INFO L226 Difference]: Without dead ends: 40 [2019-10-14 23:13:09,189 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-10-14 23:13:09,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-14 23:13:09,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-14 23:13:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-14 23:13:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-10-14 23:13:09,196 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 46 [2019-10-14 23:13:09,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:09,197 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-10-14 23:13:09,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 23:13:09,197 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-10-14 23:13:09,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-14 23:13:09,199 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:09,199 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:09,199 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:09,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:09,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1142561111, now seen corresponding path program 1 times [2019-10-14 23:13:09,200 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:09,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477136860] [2019-10-14 23:13:09,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:09,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:09,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:10,361 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-10-14 23:13:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:10,911 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2019-10-14 23:13:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-14 23:13:10,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477136860] [2019-10-14 23:13:10,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425556914] [2019-10-14 23:13:10,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:13:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:11,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 120 conjunts are in the unsatisfiable core [2019-10-14 23:13:11,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:13:11,193 INFO L375 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 [2019-10-14 23:13:11,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:11,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:11,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:13:11,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 23:13:11,249 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-10-14 23:13:11,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:11,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:11,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:13:11,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-10-14 23:13:11,295 INFO L375 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 11 [2019-10-14 23:13:11,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:11,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:11,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:13:11,303 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-10-14 23:13:11,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-10-14 23:13:11,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:11,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:11,525 INFO L375 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 15 [2019-10-14 23:13:11,525 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:11,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:11,547 INFO L375 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 21 treesize of output 13 [2019-10-14 23:13:11,548 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:13:11,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:11,565 INFO L375 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 3 [2019-10-14 23:13:11,566 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:11,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:11,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:13:11,581 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:56, output treesize:13 [2019-10-14 23:13:11,734 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:13:11,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:11,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:13:11,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:84, output treesize:70 [2019-10-14 23:13:12,826 WARN L191 SmtUtils]: Spent 975.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-10-14 23:13:13,985 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 48 [2019-10-14 23:13:14,002 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_24|], 8=[|v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_25|]} [2019-10-14 23:13:14,007 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:13:14,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:14,072 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:13:14,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:14,119 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:13:14,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:14,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-10-14 23:13:14,155 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:153, output treesize:192 [2019-10-14 23:13:20,493 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-10-14 23:13:20,523 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:20,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-10-14 23:13:20,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:20,668 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-10-14 23:13:20,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:20,672 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_BEFORE_CALL_4|], 16=[|v_#memory_$Pointer$.base_BEFORE_CALL_4|, |v_#memory_$Pointer$.offset_BEFORE_CALL_4|]} [2019-10-14 23:13:20,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:13:20,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:13:20,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 59 treesize of output 33 [2019-10-14 23:13:20,688 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:20,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:20,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:13:20,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:13:20,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 42 [2019-10-14 23:13:20,766 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:20,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:20,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:13:20,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:13:20,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 36 [2019-10-14 23:13:20,822 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:20,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:20,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:13:20,855 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:238, output treesize:86 [2019-10-14 23:13:21,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:13:21,033 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:13:21,035 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:21,035 INFO L375 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 3 case distinctions, treesize of input 107 treesize of output 55 [2019-10-14 23:13:21,038 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:13:21,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:21,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:13:21,065 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:21,065 INFO L375 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2019-10-14 23:13:21,066 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:21,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:21,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:13:21,078 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:117, output treesize:14 [2019-10-14 23:13:21,199 INFO L375 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 15 treesize of output 7 [2019-10-14 23:13:21,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:21,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:21,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:13:21,207 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-10-14 23:13:21,267 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-14 23:13:21,267 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:13:21,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 36 [2019-10-14 23:13:21,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121338571] [2019-10-14 23:13:21,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-14 23:13:21,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:21,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-14 23:13:21,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1168, Unknown=3, NotChecked=0, Total=1260 [2019-10-14 23:13:21,269 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 36 states. [2019-10-14 23:13:22,506 WARN L191 SmtUtils]: Spent 793.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-10-14 23:13:23,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:23,811 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-10-14 23:13:23,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 23:13:23,813 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 48 [2019-10-14 23:13:23,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:23,815 INFO L225 Difference]: With dead ends: 47 [2019-10-14 23:13:23,815 INFO L226 Difference]: Without dead ends: 45 [2019-10-14 23:13:23,816 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=182, Invalid=2167, Unknown=3, NotChecked=0, Total=2352 [2019-10-14 23:13:23,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-14 23:13:23,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-10-14 23:13:23,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-14 23:13:23,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-10-14 23:13:23,827 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 48 [2019-10-14 23:13:23,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:23,828 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-10-14 23:13:23,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-14 23:13:23,828 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-10-14 23:13:23,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-14 23:13:23,829 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:23,829 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-14 23:13:24,033 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:13:24,034 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:24,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:24,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1142559437, now seen corresponding path program 1 times [2019-10-14 23:13:24,035 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:24,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151586719] [2019-10-14 23:13:24,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:24,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:24,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:24,531 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-14 23:13:24,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151586719] [2019-10-14 23:13:24,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36700125] [2019-10-14 23:13:24,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:13:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:24,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-14 23:13:24,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:13:24,814 INFO L375 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 8 treesize of output 4 [2019-10-14 23:13:24,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:24,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:24,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:13:24,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-14 23:13:28,807 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.offset_26|], 8=[|v_#memory_$Pointer$.base_27|]} [2019-10-14 23:13:28,854 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:28,854 INFO L375 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 1 case distinctions, treesize of input 35 treesize of output 39 [2019-10-14 23:13:28,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:28,887 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2019-10-14 23:13:28,890 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:13:28,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:28,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 23:13:28,911 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:97, output treesize:117 [2019-10-14 23:13:31,032 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 34 [2019-10-14 23:13:31,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:13:31,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:13:31,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:13:31,060 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:31,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 88 treesize of output 49 [2019-10-14 23:13:31,062 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:31,105 INFO L567 ElimStorePlain]: treesize reduction 16, result has 76.5 percent of original size [2019-10-14 23:13:31,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:13:31,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:13:31,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:128, output treesize:50 [2019-10-14 23:13:31,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:13:31,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:13:31,180 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2019-10-14 23:13:31,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:31,185 INFO L375 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 53 treesize of output 45 [2019-10-14 23:13:31,186 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:31,218 INFO L567 ElimStorePlain]: treesize reduction 43, result has 42.7 percent of original size [2019-10-14 23:13:31,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:13:31,219 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:32 [2019-10-14 23:13:31,284 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:31,284 INFO L375 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 1 case distinctions, treesize of input 33 treesize of output 16 [2019-10-14 23:13:31,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:31,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:31,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:13:31,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:4 [2019-10-14 23:13:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-14 23:13:31,294 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:13:31,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 31 [2019-10-14 23:13:31,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893761616] [2019-10-14 23:13:31,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-14 23:13:31,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:31,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-14 23:13:31,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=851, Unknown=2, NotChecked=0, Total=930 [2019-10-14 23:13:31,296 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 31 states. [2019-10-14 23:13:32,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:32,348 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-10-14 23:13:32,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-14 23:13:32,349 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 48 [2019-10-14 23:13:32,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:32,350 INFO L225 Difference]: With dead ends: 45 [2019-10-14 23:13:32,350 INFO L226 Difference]: Without dead ends: 42 [2019-10-14 23:13:32,352 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=161, Invalid=1643, Unknown=2, NotChecked=0, Total=1806 [2019-10-14 23:13:32,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-14 23:13:32,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-10-14 23:13:32,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-14 23:13:32,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-10-14 23:13:32,359 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 48 [2019-10-14 23:13:32,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:32,360 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-10-14 23:13:32,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-14 23:13:32,360 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-10-14 23:13:32,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-14 23:13:32,361 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:32,361 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:32,565 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:13:32,565 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:32,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:32,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1510353742, now seen corresponding path program 2 times [2019-10-14 23:13:32,566 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:32,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970639152] [2019-10-14 23:13:32,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:32,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:32,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:34,279 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-10-14 23:13:35,652 WARN L191 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 97 [2019-10-14 23:13:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,410 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2019-10-14 23:13:36,429 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-14 23:13:36,429 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970639152] [2019-10-14 23:13:36,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434849543] [2019-10-14 23:13:36,430 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:13:36,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:13:36,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:13:36,565 WARN L254 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 163 conjunts are in the unsatisfiable core [2019-10-14 23:13:36,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:13:36,664 INFO L375 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 [2019-10-14 23:13:36,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:36,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:36,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:13:36,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-14 23:13:36,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-10-14 23:13:36,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:36,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:36,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:13:36,721 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-10-14 23:13:36,763 INFO L375 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 11 [2019-10-14 23:13:36,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:36,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:36,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:13:36,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-10-14 23:13:36,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-10-14 23:13:36,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:36,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:36,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:13:36,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:7 [2019-10-14 23:13:36,919 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_27|], 2=[|v_#memory_int_29|]} [2019-10-14 23:13:36,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:13:36,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 9 [2019-10-14 23:13:36,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:36,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:36,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:13:36,973 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 9 [2019-10-14 23:13:36,973 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:36,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:36,998 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:13:37,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:37,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:13:37,018 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:88, output treesize:52 [2019-10-14 23:13:37,906 WARN L191 SmtUtils]: Spent 741.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-10-14 23:13:37,934 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:37,934 INFO L375 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 17 treesize of output 39 [2019-10-14 23:13:37,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:38,000 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.1 percent of original size [2019-10-14 23:13:38,005 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-10-14 23:13:38,006 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:38,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:38,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:13:38,036 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:50 [2019-10-14 23:13:38,140 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_34|], 1=[|v_#memory_$Pointer$.offset_28|, |v_#memory_$Pointer$.base_29|]} [2019-10-14 23:13:38,144 INFO L375 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 11 [2019-10-14 23:13:38,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:38,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:38,182 INFO L375 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 11 [2019-10-14 23:13:38,183 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:38,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:38,212 INFO L375 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 11 [2019-10-14 23:13:38,212 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:38,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:38,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:13:38,233 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:84, output treesize:56 [2019-10-14 23:13:38,703 INFO L375 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 23 treesize of output 7 [2019-10-14 23:13:38,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:38,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:38,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:13:38,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-10-14 23:13:38,734 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:38,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:38,759 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:38,760 INFO L375 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 1 case distinctions, treesize of input 37 treesize of output 16 [2019-10-14 23:13:38,761 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:13:38,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:38,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:13:38,771 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:92, output treesize:13 [2019-10-14 23:13:38,890 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:13:38,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:38,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:13:38,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:84, output treesize:70 [2019-10-14 23:13:40,106 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 42 [2019-10-14 23:13:41,426 WARN L191 SmtUtils]: Spent 1.20 s on a formula simplification that was a NOOP. DAG size: 47 [2019-10-14 23:13:41,437 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_31|], 8=[|v_#memory_$Pointer$.base_31|, |v_#memory_$Pointer$.offset_30|]} [2019-10-14 23:13:41,442 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:13:41,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:41,506 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:13:41,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:41,554 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:13:41,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:13:41,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-10-14 23:13:41,593 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:153, output treesize:192