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_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:04:46,360 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:04:46,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:04:46,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:04:46,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:04:46,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:04:46,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:04:46,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:04:46,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:04:46,384 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:04:46,385 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:04:46,386 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:04:46,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:04:46,387 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:04:46,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:04:46,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:04:46,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:04:46,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:04:46,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:04:46,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:04:46,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:04:46,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:04:46,399 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:04:46,400 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:04:46,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:04:46,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:04:46,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:04:46,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:04:46,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:04:46,412 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:04:46,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:04:46,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:04:46,415 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:04:46,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:04:46,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:04:46,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:04:46,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:04:46,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:04:46,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:04:46,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:04:46,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:04:46,425 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-02 11:04:46,440 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:04:46,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:04:46,442 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:04:46,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:04:46,442 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:04:46,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:04:46,442 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:04:46,443 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:04:46,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:04:46,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:04:46,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:04:46,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:04:46,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:04:46,444 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:04:46,444 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:04:46,444 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:04:46,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:04:46,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:04:46,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:04:46,445 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:04:46,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:04:46,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:04:46,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:04:46,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:04:46,446 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:04:46,446 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:04:46,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:04:46,446 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:04:46,447 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:04:46,496 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:04:46,507 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:04:46,510 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:04:46,512 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:04:46,512 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:04:46,513 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_prepend_unequal.i [2019-10-02 11:04:46,573 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b219daeb/cba9c891192a4ee19f01b516164b9bf8/FLAG89fb033d8 [2019-10-02 11:04:47,103 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:04:47,104 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_prepend_unequal.i [2019-10-02 11:04:47,118 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b219daeb/cba9c891192a4ee19f01b516164b9bf8/FLAG89fb033d8 [2019-10-02 11:04:47,370 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b219daeb/cba9c891192a4ee19f01b516164b9bf8 [2019-10-02 11:04:47,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:04:47,382 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:04:47,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:04:47,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:04:47,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:04:47,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:04:47" (1/1) ... [2019-10-02 11:04:47,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47d41f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:04:47, skipping insertion in model container [2019-10-02 11:04:47,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:04:47" (1/1) ... [2019-10-02 11:04:47,396 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:04:47,441 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:04:47,838 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:04:47,849 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:04:47,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:04:47,970 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:04:47,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:04:47 WrapperNode [2019-10-02 11:04:47,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:04:47,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:04:47,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:04:47,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:04:47,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:04:47" (1/1) ... [2019-10-02 11:04:47,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:04:47" (1/1) ... [2019-10-02 11:04:48,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:04:47" (1/1) ... [2019-10-02 11:04:48,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:04:47" (1/1) ... [2019-10-02 11:04:48,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:04:47" (1/1) ... [2019-10-02 11:04:48,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:04:47" (1/1) ... [2019-10-02 11:04:48,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:04:47" (1/1) ... [2019-10-02 11:04:48,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:04:48,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:04:48,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:04:48,067 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:04:48,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:04:47" (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-02 11:04:48,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:04:48,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:04:48,138 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-02 11:04:48,138 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-02 11:04:48,138 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-02 11:04:48,138 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-10-02 11:04:48,139 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-10-02 11:04:48,139 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2019-10-02 11:04:48,139 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_prepend [2019-10-02 11:04:48,139 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:04:48,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:04:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-02 11:04:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-02 11:04:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-02 11:04:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-02 11:04:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-02 11:04:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-02 11:04:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-02 11:04:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-02 11:04:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-02 11:04:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-02 11:04:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-02 11:04:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-02 11:04:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-02 11:04:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-02 11:04:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-02 11:04:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-02 11:04:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-02 11:04:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-02 11:04:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-02 11:04:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-02 11:04:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-02 11:04:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-02 11:04:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-02 11:04:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-02 11:04:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-02 11:04:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-02 11:04:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-02 11:04:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-02 11:04:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-02 11:04:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-02 11:04:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-02 11:04:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-02 11:04:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-02 11:04:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-02 11:04:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-02 11:04:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-02 11:04:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-02 11:04:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-02 11:04:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-02 11:04:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-02 11:04:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-02 11:04:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-02 11:04:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-02 11:04:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-02 11:04:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-02 11:04:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-02 11:04:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-02 11:04:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-02 11:04:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-02 11:04:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-02 11:04:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-02 11:04:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-02 11:04:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 11:04:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-02 11:04:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-02 11:04:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 11:04:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-02 11:04:48,149 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-02 11:04:48,149 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-02 11:04:48,149 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-02 11:04:48,149 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-02 11:04:48,149 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-02 11:04:48,149 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-02 11:04:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-02 11:04:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-02 11:04:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 11:04:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-02 11:04:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-02 11:04:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-02 11:04:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-02 11:04:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-02 11:04:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-02 11:04:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-02 11:04:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-02 11:04:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-02 11:04:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-02 11:04:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-02 11:04:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-02 11:04:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-02 11:04:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-02 11:04:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-02 11:04:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-02 11:04:48,153 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-02 11:04:48,153 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-02 11:04:48,153 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-02 11:04:48,153 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-02 11:04:48,153 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-02 11:04:48,153 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-02 11:04:48,154 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-02 11:04:48,154 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-02 11:04:48,154 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-02 11:04:48,154 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-02 11:04:48,154 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-02 11:04:48,154 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-02 11:04:48,154 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-02 11:04:48,155 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-02 11:04:48,155 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-02 11:04:48,155 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-02 11:04:48,155 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-02 11:04:48,155 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-02 11:04:48,155 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-02 11:04:48,155 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-02 11:04:48,156 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-02 11:04:48,156 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-02 11:04:48,156 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-02 11:04:48,156 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-02 11:04:48,156 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-10-02 11:04:48,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 11:04:48,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 11:04:48,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:04:48,157 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-10-02 11:04:48,157 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2019-10-02 11:04:48,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 11:04:48,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:04:48,157 INFO L130 BoogieDeclarations]: Found specification of procedure sll_prepend [2019-10-02 11:04:48,157 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:04:48,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 11:04:48,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-02 11:04:48,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:04:48,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:04:48,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:04:48,488 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-02 11:04:48,715 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:04:48,715 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-02 11:04:48,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:04:48 BoogieIcfgContainer [2019-10-02 11:04:48,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:04:48,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:04:48,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:04:48,721 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:04:48,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:04:47" (1/3) ... [2019-10-02 11:04:48,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9278b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:04:48, skipping insertion in model container [2019-10-02 11:04:48,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:04:47" (2/3) ... [2019-10-02 11:04:48,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9278b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:04:48, skipping insertion in model container [2019-10-02 11:04:48,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:04:48" (3/3) ... [2019-10-02 11:04:48,725 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal.i [2019-10-02 11:04:48,736 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:04:48,745 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:04:48,762 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:04:48,791 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:04:48,792 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:04:48,792 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:04:48,792 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:04:48,793 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:04:48,793 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:04:48,793 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:04:48,793 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:04:48,793 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:04:48,812 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-10-02 11:04:48,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-02 11:04:48,821 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:04:48,822 INFO L411 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] [2019-10-02 11:04:48,825 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:04:48,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:04:48,830 INFO L82 PathProgramCache]: Analyzing trace with hash 266861268, now seen corresponding path program 1 times [2019-10-02 11:04:48,832 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:04:48,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:04:48,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:04:48,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:04:48,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:04:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:04:49,014 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-02 11:04:49,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:04:49,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 11:04:49,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 11:04:49,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 11:04:49,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 11:04:49,043 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-10-02 11:04:49,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:04:49,081 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2019-10-02 11:04:49,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 11:04:49,082 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2019-10-02 11:04:49,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:04:49,094 INFO L225 Difference]: With dead ends: 82 [2019-10-02 11:04:49,094 INFO L226 Difference]: Without dead ends: 34 [2019-10-02 11:04:49,097 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 11:04:49,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-02 11:04:49,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-02 11:04:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-02 11:04:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-10-02 11:04:49,141 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2019-10-02 11:04:49,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:04:49,141 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-10-02 11:04:49,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 11:04:49,142 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-10-02 11:04:49,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-02 11:04:49,144 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:04:49,144 INFO L411 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] [2019-10-02 11:04:49,145 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:04:49,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:04:49,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1567298356, now seen corresponding path program 1 times [2019-10-02 11:04:49,145 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:04:49,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:04:49,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:04:49,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:04:49,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:04:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:04:49,330 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-02 11:04:49,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:04:49,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:04:49,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:04:49,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:04:49,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:04:49,334 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2019-10-02 11:04:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:04:49,405 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2019-10-02 11:04:49,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:04:49,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-10-02 11:04:49,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:04:49,408 INFO L225 Difference]: With dead ends: 60 [2019-10-02 11:04:49,408 INFO L226 Difference]: Without dead ends: 38 [2019-10-02 11:04:49,410 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:04:49,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-02 11:04:49,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2019-10-02 11:04:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-02 11:04:49,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-10-02 11:04:49,429 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 27 [2019-10-02 11:04:49,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:04:49,430 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-10-02 11:04:49,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:04:49,430 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-10-02 11:04:49,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-02 11:04:49,432 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:04:49,433 INFO L411 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] [2019-10-02 11:04:49,433 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:04:49,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:04:49,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1679873603, now seen corresponding path program 1 times [2019-10-02 11:04:49,434 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:04:49,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:04:49,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:04:49,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:04:49,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:04:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:04:49,592 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-02 11:04:49,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:04:49,593 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:04:49,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:04:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:04:49,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 11:04:49,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:04:49,851 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-02 11:04:49,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:04:49,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-10-02 11:04:49,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:04:49,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:04:49,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:04:49,861 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2019-10-02 11:04:49,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:04:49,932 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2019-10-02 11:04:49,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:04:49,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-10-02 11:04:49,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:04:49,935 INFO L225 Difference]: With dead ends: 64 [2019-10-02 11:04:49,935 INFO L226 Difference]: Without dead ends: 42 [2019-10-02 11:04:49,935 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:04:49,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-02 11:04:49,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-10-02 11:04:49,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-02 11:04:49,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-10-02 11:04:49,943 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 36 [2019-10-02 11:04:49,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:04:49,944 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-10-02 11:04:49,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:04:49,944 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2019-10-02 11:04:49,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-02 11:04:49,945 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:04:49,946 INFO L411 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] [2019-10-02 11:04:49,946 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:04:49,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:04:49,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1518605332, now seen corresponding path program 2 times [2019-10-02 11:04:49,947 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:04:49,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:04:49,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:04:49,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:04:49,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:04:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:04:50,309 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-02 11:04:50,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:04:50,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:04:50,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:04:50,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:04:50,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:04:50,311 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 10 states. [2019-10-02 11:04:50,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:04:50,624 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-10-02 11:04:50,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:04:50,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-10-02 11:04:50,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:04:50,626 INFO L225 Difference]: With dead ends: 41 [2019-10-02 11:04:50,626 INFO L226 Difference]: Without dead ends: 39 [2019-10-02 11:04:50,627 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:04:50,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-02 11:04:50,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-10-02 11:04:50,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-02 11:04:50,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-10-02 11:04:50,635 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 45 [2019-10-02 11:04:50,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:04:50,636 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-02 11:04:50,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:04:50,636 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-10-02 11:04:50,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-02 11:04:50,637 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:04:50,638 INFO L411 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] [2019-10-02 11:04:50,638 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:04:50,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:04:50,638 INFO L82 PathProgramCache]: Analyzing trace with hash 909201437, now seen corresponding path program 1 times [2019-10-02 11:04:50,658 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:04:50,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:04:50,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:04:50,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:04:50,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:04:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:04:51,160 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:04:51,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:04:51,161 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:04:51,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:04:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:04:51,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-02 11:04:51,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:04:51,492 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-02 11:04:51,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:04:51,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:04:51,500 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-02 11:04:51,500 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-02 11:04:55,665 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2019-10-02 11:04:59,795 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 26 [2019-10-02 11:04:59,811 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.offset_25|], 10=[|v_#memory_$Pointer$.base_26|]} [2019-10-02 11:04:59,854 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:04:59,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 39 treesize of output 47 [2019-10-02 11:04:59,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:04:59,890 INFO L567 ElimStorePlain]: treesize reduction 20, result has 78.3 percent of original size [2019-10-02 11:04:59,897 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-02 11:04:59,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:04:59,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:04:59,934 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:104, output treesize:95 [2019-10-02 11:05:01,962 WARN L860 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset Int) (sll_prepend_~new_head~1.base Int) (v_DerPreprocessor_1 Int)) (and (<= (+ |c_#StackHeapBarrier| 1) sll_prepend_~new_head~1.base) (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (let ((.cse1 (store (store (select |c_old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_1))) (store .cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_sll_prepend_#in~head.base|) |c_sll_prepend_#in~head.offset|) 4) (select (select (store |c_old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base .cse1) |c_sll_prepend_#in~head.base|) |c_sll_prepend_#in~head.offset|)))))) (store .cse0 |c_sll_prepend_#in~head.base| (store (select .cse0 |c_sll_prepend_#in~head.base|) |c_sll_prepend_#in~head.offset| sll_prepend_~new_head~1.base)))))) is different from true [2019-10-02 11:05:01,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:05:01,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:05:02,045 INFO L341 Elim1Store]: treesize reduction 32, result has 71.2 percent of original size [2019-10-02 11:05:02,048 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 2 case distinctions, treesize of input 72 treesize of output 103 [2019-10-02 11:05:02,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:05:02,124 INFO L567 ElimStorePlain]: treesize reduction 60, result has 53.1 percent of original size [2019-10-02 11:05:02,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:05:02,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:05:02,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:05:02,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:106, output treesize:31 [2019-10-02 11:05:02,210 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 26 treesize of output 18 [2019-10-02 11:05:02,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:05:02,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:05:02,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:05:02,221 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:31 [2019-10-02 11:05:02,320 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:05:02,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2019-10-02 11:05:02,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:05:02,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:05:02,327 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-02 11:05:02,341 INFO L567 ElimStorePlain]: treesize reduction 14, result has 41.7 percent of original size [2019-10-02 11:05:02,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:05:02,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:4 [2019-10-02 11:05:02,350 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:05:02,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:05:02,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 29 [2019-10-02 11:05:02,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 11:05:02,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 11:05:02,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=688, Unknown=3, NotChecked=52, Total=812 [2019-10-02 11:05:02,361 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 29 states. [2019-10-02 11:05:08,858 WARN L191 SmtUtils]: Spent 6.21 s on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2019-10-02 11:05:12,694 WARN L191 SmtUtils]: Spent 3.49 s on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-10-02 11:05:18,875 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-10-02 11:05:19,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:05:19,190 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-10-02 11:05:19,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 11:05:19,192 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 47 [2019-10-02 11:05:19,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:05:19,193 INFO L225 Difference]: With dead ends: 46 [2019-10-02 11:05:19,193 INFO L226 Difference]: Without dead ends: 43 [2019-10-02 11:05:19,194 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 27.1s TimeCoverageRelationStatistics Valid=124, Invalid=1282, Unknown=4, NotChecked=72, Total=1482 [2019-10-02 11:05:19,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-02 11:05:19,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-10-02 11:05:19,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-02 11:05:19,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-10-02 11:05:19,201 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 47 [2019-10-02 11:05:19,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:05:19,202 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-10-02 11:05:19,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 11:05:19,202 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-10-02 11:05:19,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-02 11:05:19,203 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:05:19,203 INFO L411 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] [2019-10-02 11:05:19,203 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:05:19,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:05:19,204 INFO L82 PathProgramCache]: Analyzing trace with hash 909203111, now seen corresponding path program 1 times [2019-10-02 11:05:19,204 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:05:19,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:05:19,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:05:19,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:05:19,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:05:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:05:20,554 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:05:20,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:05:20,555 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:05:20,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:05:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:05:20,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 105 conjunts are in the unsatisfiable core [2019-10-02 11:05:20,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:05:20,816 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-02 11:05:20,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:05:20,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:05:20,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:05:20,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 11:05:20,836 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-02 11:05:20,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:05:20,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:05:20,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:05:20,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-10-02 11:05:20,871 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-02 11:05:20,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:05:20,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:05:20,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:05:20,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-10-02 11:05:21,086 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-02 11:05:21,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:05:21,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:05:21,113 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 15 treesize of output 7 [2019-10-02 11:05:21,114 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:05:21,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:05:21,133 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-02 11:05:21,134 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-02 11:05:21,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:05:21,151 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-02 11:05:21,151 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 11:05:21,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:05:21,163 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-02 11:05:21,163 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:59, output treesize:13 [2019-10-02 11:05:21,290 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-02 11:05:21,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:05:21,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:05:21,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:79, output treesize:65 [2019-10-02 11:05:25,427 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 40 [2019-10-02 11:05:29,547 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 46 [2019-10-02 11:05:29,561 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_25|], 10=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_27|]} [2019-10-02 11:05:29,570 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-02 11:05:29,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:05:29,639 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-02 11:05:29,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:05:29,700 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-02 11:05:29,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:05:29,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-10-02 11:05:29,751 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:169, output treesize:222 [2019-10-02 11:05:42,063 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-10-02 11:05:42,090 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:05:42,091 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-02 11:05:42,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:05:42,200 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-10-02 11:05:42,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:05:42,204 INFO L392 ElimStorePlain]: Different costs {8=[|v_old(#memory_int)_AFTER_CALL_14|], 20=[|v_#memory_$Pointer$.offset_BEFORE_CALL_4|, |v_#memory_$Pointer$.base_BEFORE_CALL_8|]} [2019-10-02 11:05:42,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:05:42,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:05:42,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:05:42,262 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:05:42,263 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 2 case distinctions, treesize of input 63 treesize of output 86 [2019-10-02 11:05:42,264 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:05:42,515 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-10-02 11:05:42,516 INFO L567 ElimStorePlain]: treesize reduction 32, result has 88.9 percent of original size [2019-10-02 11:05:42,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:05:42,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:05:42,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:05:42,568 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:05:42,569 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 2 case distinctions, treesize of input 70 treesize of output 85 [2019-10-02 11:05:42,570 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 11:05:42,769 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-10-02 11:05:42,769 INFO L567 ElimStorePlain]: treesize reduction 52, result has 79.9 percent of original size [2019-10-02 11:05:42,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:05:42,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:05:42,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:05:42,820 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:05:42,821 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 2 case distinctions, treesize of input 84 treesize of output 95 [2019-10-02 11:05:42,822 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 11:05:42,971 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-10-02 11:05:42,972 INFO L567 ElimStorePlain]: treesize reduction 44, result has 79.3 percent of original size [2019-10-02 11:05:42,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:05:42,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:05:42,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:05:42,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:05:42,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:05:42,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:05:42,994 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:273, output treesize:243 [2019-10-02 11:05:43,284 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:05:43,285 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 85 [2019-10-02 11:05:43,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:05:43,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:05:43,288 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-02 11:05:43,330 INFO L567 ElimStorePlain]: treesize reduction 18, result has 78.0 percent of original size [2019-10-02 11:05:43,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:05:43,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 15 [2019-10-02 11:05:43,337 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:05:43,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:05:43,353 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-02 11:05:43,353 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:143, output treesize:17 [2019-10-02 11:05:43,432 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 11:05:43,438 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:05:43,439 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2019-10-02 11:05:43,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:05:43,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:05:43,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:05:43,447 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:7 [2019-10-02 11:05:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:05:43,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:05:43,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 33 [2019-10-02 11:05:43,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 11:05:43,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 11:05:43,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=971, Unknown=8, NotChecked=0, Total=1056 [2019-10-02 11:05:43,524 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 33 states. [2019-10-02 11:05:58,139 WARN L191 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2019-10-02 11:06:09,065 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-10-02 11:06:09,519 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 70 [2019-10-02 11:06:10,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:06:10,517 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-10-02 11:06:10,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 11:06:10,519 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2019-10-02 11:06:10,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:06:10,520 INFO L225 Difference]: With dead ends: 43 [2019-10-02 11:06:10,520 INFO L226 Difference]: Without dead ends: 41 [2019-10-02 11:06:10,522 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 37.7s TimeCoverageRelationStatistics Valid=150, Invalid=1819, Unknown=11, NotChecked=0, Total=1980 [2019-10-02 11:06:10,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-02 11:06:10,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-02 11:06:10,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-02 11:06:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-10-02 11:06:10,529 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 47 [2019-10-02 11:06:10,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:06:10,529 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-10-02 11:06:10,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 11:06:10,530 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-10-02 11:06:10,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-02 11:06:10,530 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:06:10,531 INFO L411 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, 1] [2019-10-02 11:06:10,531 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:06:10,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:06:10,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1865873432, now seen corresponding path program 1 times [2019-10-02 11:06:10,531 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:06:10,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:06:10,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:06:10,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:06:10,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:06:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:06:11,719 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-10-02 11:06:11,950 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 11:06:11,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:06:11,951 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:06:12,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:06:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:06:12,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 102 conjunts are in the unsatisfiable core [2019-10-02 11:06:12,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:06:12,170 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-02 11:06:12,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:06:12,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:06:12,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:06:12,177 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-02 11:06:12,218 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 11 treesize of output 7 [2019-10-02 11:06:12,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:06:12,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:06:12,236 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-02 11:06:12,236 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-10-02 11:06:12,412 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-02 11:06:12,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:06:12,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:06:12,437 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 15 treesize of output 7 [2019-10-02 11:06:12,438 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:06:12,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:06:12,462 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:06:12,463 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 22 treesize of output 13 [2019-10-02 11:06:12,464 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 11:06:12,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:06:12,476 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-02 11:06:12,476 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:10 [2019-10-02 11:06:16,703 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 31 [2019-10-02 11:06:20,833 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 37 [2019-10-02 11:06:20,842 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-02 11:06:20,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:06:20,889 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-02 11:06:20,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:06:20,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-10-02 11:06:20,924 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:127, output treesize:171 [2019-10-02 11:06:33,203 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:06:33,203 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-02 11:06:33,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:06:33,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:06:33,286 INFO L392 ElimStorePlain]: Different costs {20=[|v_#memory_$Pointer$.offset_BEFORE_CALL_8|], 32=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_19|]} [2019-10-02 11:06:33,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:06:33,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:06:33,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:06:33,337 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:06:33,338 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 2 case distinctions, treesize of input 70 treesize of output 85 [2019-10-02 11:06:33,340 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:06:33,480 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-10-02 11:06:33,480 INFO L567 ElimStorePlain]: treesize reduction 52, result has 76.1 percent of original size [2019-10-02 11:06:33,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:06:33,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:06:33,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:06:33,625 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-10-02 11:06:33,626 INFO L341 Elim1Store]: treesize reduction 59, result has 65.9 percent of original size [2019-10-02 11:06:33,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 85 treesize of output 146 [2019-10-02 11:06:33,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 11:06:33,629 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 11:06:33,748 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-10-02 11:06:33,749 INFO L567 ElimStorePlain]: treesize reduction 124, result has 50.8 percent of original size [2019-10-02 11:06:33,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:06:33,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:06:33,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:06:33,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:06:33,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:06:33,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:06:33,756 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:220, output treesize:201 [2019-10-02 11:06:33,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:06:33,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:06:33,994 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 0 case distinctions, treesize of input 132 treesize of output 79 [2019-10-02 11:06:33,996 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-02 11:06:34,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:06:34,016 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-02 11:06:34,016 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:141, output treesize:80 [2019-10-02 11:06:34,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:06:34,112 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 11:06:34,140 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:06:34,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 75 [2019-10-02 11:06:34,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:06:34,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:06:34,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:06:34,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:06:34,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:06:34,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:06:34,148 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 11:06:34,184 INFO L567 ElimStorePlain]: treesize reduction 44, result has 36.2 percent of original size [2019-10-02 11:06:34,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:06:34,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:86, output treesize:4 [2019-10-02 11:06:34,196 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 11:06:34,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:06:34,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 37 [2019-10-02 11:06:34,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-02 11:06:34,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-02 11:06:34,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1237, Unknown=8, NotChecked=0, Total=1332 [2019-10-02 11:06:34,202 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 37 states. [2019-10-02 11:06:47,531 WARN L191 SmtUtils]: Spent 4.33 s on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-10-02 11:06:58,330 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-10-02 11:06:59,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:06:59,833 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-10-02 11:06:59,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 11:06:59,838 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 49 [2019-10-02 11:06:59,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:06:59,840 INFO L225 Difference]: With dead ends: 49 [2019-10-02 11:06:59,840 INFO L226 Difference]: Without dead ends: 46 [2019-10-02 11:06:59,842 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 38.0s TimeCoverageRelationStatistics Valid=182, Invalid=2257, Unknown=11, NotChecked=0, Total=2450 [2019-10-02 11:06:59,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-02 11:06:59,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2019-10-02 11:06:59,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-02 11:06:59,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-10-02 11:06:59,854 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 49 [2019-10-02 11:06:59,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:06:59,855 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-10-02 11:06:59,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-02 11:06:59,855 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-10-02 11:06:59,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-02 11:06:59,858 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:06:59,858 INFO L411 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, 1] [2019-10-02 11:06:59,858 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:06:59,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:06:59,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1865875106, now seen corresponding path program 1 times [2019-10-02 11:06:59,859 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:06:59,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:06:59,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:06:59,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:06:59,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:06:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:07:01,467 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-10-02 11:07:01,788 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-10-02 11:07:03,785 WARN L191 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 117 DAG size of output: 116 [2019-10-02 11:07:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:07:04,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:07:04,897 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:07:04,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:07:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:07:05,048 WARN L254 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 151 conjunts are in the unsatisfiable core [2019-10-02 11:07:05,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:07:05,153 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-02 11:07:05,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:07:05,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:07:05,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:07:05,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 11:07:05,171 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-02 11:07:05,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:07:05,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:07:05,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:07:05,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-10-02 11:07:05,204 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-02 11:07:05,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:07:05,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:07:05,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:07:05,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-10-02 11:07:05,219 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-02 11:07:05,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:07:05,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:07:05,226 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-02 11:07:05,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:7 [2019-10-02 11:07:05,253 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_30|, |v_#memory_$Pointer$.base_32|], 2=[|v_#memory_int_30|]} [2019-10-02 11:07:05,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:07:05,261 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-02 11:07:05,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:07:05,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:07:05,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:07:05,318 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-02 11:07:05,319 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:07:05,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:07:05,360 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-02 11:07:05,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:07:05,388 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-02 11:07:05,389 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:101, output treesize:65 [2019-10-02 11:07:06,943 WARN L191 SmtUtils]: Spent 1.42 s on a formula simplification that was a NOOP. DAG size: 39 [2019-10-02 11:07:06,985 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:07:07,186 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:07:07,188 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#valid_BEFORE_CALL_10| input size 35 context size 35 output size 35 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:349) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:465) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-02 11:07:07,193 INFO L168 Benchmark]: Toolchain (without parser) took 139811.08 ms. Allocated memory was 133.7 MB in the beginning and 389.5 MB in the end (delta: 255.9 MB). Free memory was 88.5 MB in the beginning and 179.9 MB in the end (delta: -91.4 MB). Peak memory consumption was 164.4 MB. Max. memory is 7.1 GB. [2019-10-02 11:07:07,194 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory was 107.9 MB in the beginning and 107.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 11:07:07,195 INFO L168 Benchmark]: CACSL2BoogieTranslator took 587.74 ms. Allocated memory was 133.7 MB in the beginning and 200.8 MB in the end (delta: 67.1 MB). Free memory was 88.3 MB in the beginning and 161.7 MB in the end (delta: -73.4 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-10-02 11:07:07,201 INFO L168 Benchmark]: Boogie Preprocessor took 92.40 ms. Allocated memory is still 200.8 MB. Free memory was 161.7 MB in the beginning and 158.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-10-02 11:07:07,202 INFO L168 Benchmark]: RCFGBuilder took 649.85 ms. Allocated memory is still 200.8 MB. Free memory was 158.2 MB in the beginning and 111.5 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-10-02 11:07:07,203 INFO L168 Benchmark]: TraceAbstraction took 138473.46 ms. Allocated memory was 200.8 MB in the beginning and 389.5 MB in the end (delta: 188.7 MB). Free memory was 110.9 MB in the beginning and 179.9 MB in the end (delta: -69.0 MB). Peak memory consumption was 119.7 MB. Max. memory is 7.1 GB. [2019-10-02 11:07:07,207 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory was 107.9 MB in the beginning and 107.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 587.74 ms. Allocated memory was 133.7 MB in the beginning and 200.8 MB in the end (delta: 67.1 MB). Free memory was 88.3 MB in the beginning and 161.7 MB in the end (delta: -73.4 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 92.40 ms. Allocated memory is still 200.8 MB. Free memory was 161.7 MB in the beginning and 158.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 649.85 ms. Allocated memory is still 200.8 MB. Free memory was 158.2 MB in the beginning and 111.5 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 138473.46 ms. Allocated memory was 200.8 MB in the beginning and 389.5 MB in the end (delta: 188.7 MB). Free memory was 110.9 MB in the beginning and 179.9 MB in the end (delta: -69.0 MB). Peak memory consumption was 119.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#valid_BEFORE_CALL_10| input size 35 context size 35 output size 35 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#valid_BEFORE_CALL_10| input size 35 context size 35 output size 35: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...