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_insert_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:03:10,284 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:03:10,287 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:03:10,306 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:03:10,307 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:03:10,308 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:03:10,311 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:03:10,323 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:03:10,324 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:03:10,325 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:03:10,326 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:03:10,327 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:03:10,327 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:03:10,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:03:10,329 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:03:10,330 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:03:10,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:03:10,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:03:10,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:03:10,335 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:03:10,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:03:10,338 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:03:10,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:03:10,339 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:03:10,341 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:03:10,342 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:03:10,342 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:03:10,343 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:03:10,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:03:10,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:03:10,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:03:10,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:03:10,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:03:10,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:03:10,347 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:03:10,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:03:10,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:03:10,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:03:10,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:03:10,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:03:10,350 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:03:10,351 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:03:10,365 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:03:10,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:03:10,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:03:10,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:03:10,367 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:03:10,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:03:10,367 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:03:10,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:03:10,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:03:10,368 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:03:10,368 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:03:10,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:03:10,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:03:10,368 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:03:10,369 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:03:10,369 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:03:10,369 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:03:10,369 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:03:10,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:03:10,370 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:03:10,370 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:03:10,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:03:10,370 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:03:10,370 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:03:10,371 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:03:10,371 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:03:10,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:03:10,371 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:03:10,371 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:03:10,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:03:10,412 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:03:10,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:03:10,418 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:03:10,418 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:03:10,419 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_insert_unequal.i [2019-10-02 11:03:10,494 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7745b9965/f6a43eff7fbb444a8d34c9ebe9bf1d29/FLAG024f3d556 [2019-10-02 11:03:11,073 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:03:11,074 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_insert_unequal.i [2019-10-02 11:03:11,087 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7745b9965/f6a43eff7fbb444a8d34c9ebe9bf1d29/FLAG024f3d556 [2019-10-02 11:03:11,351 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7745b9965/f6a43eff7fbb444a8d34c9ebe9bf1d29 [2019-10-02 11:03:11,361 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:03:11,364 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:03:11,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:03:11,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:03:11,368 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:03:11,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:03:11" (1/1) ... [2019-10-02 11:03:11,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35299c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:03:11, skipping insertion in model container [2019-10-02 11:03:11,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:03:11" (1/1) ... [2019-10-02 11:03:11,380 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:03:11,419 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:03:11,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:03:11,850 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:03:11,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:03:11,984 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:03:11,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:03:11 WrapperNode [2019-10-02 11:03:11,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:03:11,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:03:11,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:03:11,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:03:12,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:03:11" (1/1) ... [2019-10-02 11:03:12,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:03:11" (1/1) ... [2019-10-02 11:03:12,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:03:11" (1/1) ... [2019-10-02 11:03:12,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:03:11" (1/1) ... [2019-10-02 11:03:12,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:03:11" (1/1) ... [2019-10-02 11:03:12,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:03:11" (1/1) ... [2019-10-02 11:03:12,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:03:11" (1/1) ... [2019-10-02 11:03:12,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:03:12,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:03:12,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:03:12,079 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:03:12,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:03:11" (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:03:12,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:03:12,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:03:12,137 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-02 11:03:12,137 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-02 11:03:12,138 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-02 11:03:12,138 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-10-02 11:03:12,139 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-10-02 11:03:12,139 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2019-10-02 11:03:12,140 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2019-10-02 11:03:12,140 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:03:12,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:03:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:03:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-02 11:03:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-02 11:03:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-02 11:03:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-02 11:03:12,145 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-02 11:03:12,145 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-02 11:03:12,145 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-02 11:03:12,145 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-02 11:03:12,145 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-02 11:03:12,146 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-02 11:03:12,146 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-02 11:03:12,146 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-02 11:03:12,146 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-02 11:03:12,146 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-02 11:03:12,146 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-02 11:03:12,146 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-02 11:03:12,147 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-02 11:03:12,147 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-02 11:03:12,147 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-02 11:03:12,147 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-02 11:03:12,147 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-02 11:03:12,147 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-02 11:03:12,147 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-02 11:03:12,148 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-02 11:03:12,148 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-02 11:03:12,148 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-02 11:03:12,148 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-02 11:03:12,148 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-02 11:03:12,148 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-02 11:03:12,149 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-02 11:03:12,149 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-02 11:03:12,149 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-02 11:03:12,149 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-02 11:03:12,150 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-02 11:03:12,150 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-02 11:03:12,150 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-02 11:03:12,150 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-02 11:03:12,150 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-02 11:03:12,150 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-02 11:03:12,150 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-02 11:03:12,151 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-02 11:03:12,151 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-02 11:03:12,151 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-02 11:03:12,151 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-02 11:03:12,151 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-02 11:03:12,151 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-02 11:03:12,151 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-02 11:03:12,152 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-02 11:03:12,152 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-02 11:03:12,152 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-02 11:03:12,152 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-02 11:03:12,152 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-02 11:03:12,152 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 11:03:12,152 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-02 11:03:12,153 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-02 11:03:12,153 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 11:03:12,154 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-02 11:03:12,154 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-02 11:03:12,155 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-02 11:03:12,155 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-02 11:03:12,155 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-02 11:03:12,155 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-02 11:03:12,156 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-02 11:03:12,156 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-02 11:03:12,156 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-02 11:03:12,156 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 11:03:12,156 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-02 11:03:12,157 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-02 11:03:12,157 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-02 11:03:12,157 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-02 11:03:12,158 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-02 11:03:12,158 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-02 11:03:12,158 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-02 11:03:12,158 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-02 11:03:12,158 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-02 11:03:12,159 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-02 11:03:12,159 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-02 11:03:12,160 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-02 11:03:12,160 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-02 11:03:12,160 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-02 11:03:12,161 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-02 11:03:12,161 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-02 11:03:12,161 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-02 11:03:12,161 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-02 11:03:12,161 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-02 11:03:12,161 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-02 11:03:12,162 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-02 11:03:12,162 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-02 11:03:12,162 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-02 11:03:12,162 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-02 11:03:12,162 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-02 11:03:12,162 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-02 11:03:12,162 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-02 11:03:12,163 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-02 11:03:12,163 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-02 11:03:12,163 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-02 11:03:12,163 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-02 11:03:12,163 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-02 11:03:12,163 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-02 11:03:12,163 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-02 11:03:12,164 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-02 11:03:12,164 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-02 11:03:12,164 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-02 11:03:12,164 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-02 11:03:12,165 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-02 11:03:12,165 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-02 11:03:12,165 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-10-02 11:03:12,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 11:03:12,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 11:03:12,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:03:12,166 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-10-02 11:03:12,166 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2019-10-02 11:03:12,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 11:03:12,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:03:12,167 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2019-10-02 11:03:12,167 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:03:12,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 11:03:12,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-02 11:03:12,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:03:12,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:03:12,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:03:12,553 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-02 11:03:12,801 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:03:12,801 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-02 11:03:12,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:03:12 BoogieIcfgContainer [2019-10-02 11:03:12,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:03:12,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:03:12,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:03:12,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:03:12,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:03:11" (1/3) ... [2019-10-02 11:03:12,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc5e3c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:03:12, skipping insertion in model container [2019-10-02 11:03:12,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:03:11" (2/3) ... [2019-10-02 11:03:12,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc5e3c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:03:12, skipping insertion in model container [2019-10-02 11:03:12,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:03:12" (3/3) ... [2019-10-02 11:03:12,815 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2019-10-02 11:03:12,826 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:03:12,836 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:03:12,850 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:03:12,877 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:03:12,878 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:03:12,878 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:03:12,878 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:03:12,878 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:03:12,879 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:03:12,879 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:03:12,879 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:03:12,879 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:03:12,899 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-10-02 11:03:12,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 11:03:12,906 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:03:12,907 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, 1, 1, 1, 1] [2019-10-02 11:03:12,909 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:03:12,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:03:12,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1925718240, now seen corresponding path program 1 times [2019-10-02 11:03:12,917 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:03:12,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:03:12,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:03:12,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:03:12,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:03:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:03:13,104 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:03:13,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:03:13,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 11:03:13,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 11:03:13,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 11:03:13,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 11:03:13,134 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 2 states. [2019-10-02 11:03:13,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:03:13,183 INFO L93 Difference]: Finished difference Result 94 states and 125 transitions. [2019-10-02 11:03:13,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 11:03:13,184 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2019-10-02 11:03:13,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:03:13,199 INFO L225 Difference]: With dead ends: 94 [2019-10-02 11:03:13,200 INFO L226 Difference]: Without dead ends: 40 [2019-10-02 11:03:13,212 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:03:13,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-02 11:03:13,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-02 11:03:13,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-02 11:03:13,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-10-02 11:03:13,266 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 31 [2019-10-02 11:03:13,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:03:13,267 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-10-02 11:03:13,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 11:03:13,267 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-10-02 11:03:13,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 11:03:13,270 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:03:13,270 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, 1, 1, 1, 1] [2019-10-02 11:03:13,271 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:03:13,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:03:13,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1001067800, now seen corresponding path program 1 times [2019-10-02 11:03:13,271 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:03:13,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:03:13,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:03:13,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:03:13,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:03:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:03:13,448 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:03:13,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:03:13,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:03:13,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:03:13,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:03:13,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:03:13,453 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 3 states. [2019-10-02 11:03:13,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:03:13,482 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2019-10-02 11:03:13,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:03:13,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-02 11:03:13,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:03:13,486 INFO L225 Difference]: With dead ends: 58 [2019-10-02 11:03:13,487 INFO L226 Difference]: Without dead ends: 45 [2019-10-02 11:03:13,488 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:03:13,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-02 11:03:13,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-10-02 11:03:13,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-02 11:03:13,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2019-10-02 11:03:13,497 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 31 [2019-10-02 11:03:13,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:03:13,499 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2019-10-02 11:03:13,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:03:13,499 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2019-10-02 11:03:13,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 11:03:13,501 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:03:13,501 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, 1, 1, 1, 1] [2019-10-02 11:03:13,501 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:03:13,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:03:13,502 INFO L82 PathProgramCache]: Analyzing trace with hash 191721174, now seen corresponding path program 1 times [2019-10-02 11:03:13,502 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:03:13,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:03:13,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:03:13,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:03:13,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:03:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:03:13,699 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:03:13,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:03:13,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:03:13,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:03:13,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:03:13,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:03:13,701 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 9 states. [2019-10-02 11:03:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:03:13,836 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2019-10-02 11:03:13,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:03:13,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-10-02 11:03:13,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:03:13,838 INFO L225 Difference]: With dead ends: 79 [2019-10-02 11:03:13,838 INFO L226 Difference]: Without dead ends: 49 [2019-10-02 11:03:13,839 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:03:13,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-02 11:03:13,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2019-10-02 11:03:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-02 11:03:13,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-10-02 11:03:13,847 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 31 [2019-10-02 11:03:13,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:03:13,847 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-10-02 11:03:13,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:03:13,848 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2019-10-02 11:03:13,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-02 11:03:13,849 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:03:13,849 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, 1, 1, 1, 1] [2019-10-02 11:03:13,849 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:03:13,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:03:13,850 INFO L82 PathProgramCache]: Analyzing trace with hash -833744621, now seen corresponding path program 1 times [2019-10-02 11:03:13,850 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:03:13,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:03:13,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:03:13,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:03:13,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:03:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:03:14,016 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:03:14,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:03:14,017 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:03:14,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:03:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:03:14,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 11:03:14,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:03:14,242 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:03:14,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:03:14,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 10 [2019-10-02 11:03:14,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:03:14,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:03:14,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:03:14,252 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 10 states. [2019-10-02 11:03:14,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:03:14,396 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2019-10-02 11:03:14,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:03:14,397 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-10-02 11:03:14,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:03:14,399 INFO L225 Difference]: With dead ends: 83 [2019-10-02 11:03:14,399 INFO L226 Difference]: Without dead ends: 53 [2019-10-02 11:03:14,400 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:03:14,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-02 11:03:14,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2019-10-02 11:03:14,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-02 11:03:14,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2019-10-02 11:03:14,408 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 40 [2019-10-02 11:03:14,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:03:14,409 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2019-10-02 11:03:14,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:03:14,409 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2019-10-02 11:03:14,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-02 11:03:14,411 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:03:14,411 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:03:14,411 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:03:14,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:03:14,412 INFO L82 PathProgramCache]: Analyzing trace with hash -159145098, now seen corresponding path program 2 times [2019-10-02 11:03:14,412 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:03:14,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:03:14,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:03:14,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:03:14,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:03:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:03:14,580 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 11:03:14,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:03:14,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:03:14,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:03:14,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:03:14,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:03:14,582 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand 6 states. [2019-10-02 11:03:14,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:03:14,654 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2019-10-02 11:03:14,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:03:14,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-10-02 11:03:14,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:03:14,656 INFO L225 Difference]: With dead ends: 60 [2019-10-02 11:03:14,656 INFO L226 Difference]: Without dead ends: 46 [2019-10-02 11:03:14,656 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:03:14,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-02 11:03:14,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-10-02 11:03:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-02 11:03:14,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2019-10-02 11:03:14,663 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 49 [2019-10-02 11:03:14,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:03:14,663 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2019-10-02 11:03:14,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:03:14,664 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2019-10-02 11:03:14,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 11:03:14,665 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:03:14,665 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, 1] [2019-10-02 11:03:14,665 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:03:14,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:03:14,666 INFO L82 PathProgramCache]: Analyzing trace with hash 358537395, now seen corresponding path program 1 times [2019-10-02 11:03:14,666 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:03:14,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:03:14,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:03:14,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:03:14,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:03:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:03:15,877 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-10-02 11:03:16,135 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-02 11:03:16,372 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-10-02 11:03:16,718 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2019-10-02 11:03:17,080 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-10-02 11:03:17,243 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:03:17,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:03:17,243 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:03:17,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:03:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:03:17,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 121 conjunts are in the unsatisfiable core [2019-10-02 11:03:17,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:03:17,548 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:03:17,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:03:17,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:17,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:03:17,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-02 11:03:17,640 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:03:17,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:03:17,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:17,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:03:17,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-02 11:03:17,779 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 30 treesize of output 14 [2019-10-02 11:03:17,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:03:17,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:17,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:03:17,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2019-10-02 11:03:18,089 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:03:18,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:03:18,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:18,119 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:03:18,123 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:03:18,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:18,148 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 30 treesize of output 18 [2019-10-02 11:03:18,149 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:03:18,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:18,171 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:03:18,171 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 11:03:18,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:18,184 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:03:18,185 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:61, output treesize:13 [2019-10-02 11:03:18,334 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:03:18,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:18,358 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:03:18,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:82, output treesize:68 [2019-10-02 11:03:19,557 WARN L191 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 40 [2019-10-02 11:03:20,805 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 46 [2019-10-02 11:03:22,047 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 50 [2019-10-02 11:03:23,295 WARN L191 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 50 [2019-10-02 11:03:23,320 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:03:23,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:23,410 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:03:23,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:23,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-02 11:03:23,471 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:167, output treesize:322 [2019-10-02 11:03:25,679 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:03:25,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:25,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-10-02 11:03:25,746 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:470, output treesize:508 [2019-10-02 11:03:44,257 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-10-02 11:03:44,285 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:44,285 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:03:44,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:03:44,407 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-10-02 11:03:44,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:44,412 INFO L392 ElimStorePlain]: Different costs {3=[|v_#memory_int_BEFORE_CALL_4|], 16=[|v_#memory_$Pointer$.base_BEFORE_CALL_4|, |v_#memory_$Pointer$.offset_BEFORE_CALL_4|]} [2019-10-02 11:03:44,429 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 11:03:44,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:03:44,436 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 0 case distinctions, treesize of input 192 treesize of output 64 [2019-10-02 11:03:44,437 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:03:44,566 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-10-02 11:03:44,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:44,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:03:44,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:03:44,715 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-10-02 11:03:44,716 INFO L341 Elim1Store]: treesize reduction 33, result has 85.7 percent of original size [2019-10-02 11:03:44,716 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 310 treesize of output 359 [2019-10-02 11:03:44,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 11:03:44,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:44,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:03:44,726 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 11:03:44,989 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-10-02 11:03:44,989 INFO L567 ElimStorePlain]: treesize reduction 486, result has 34.6 percent of original size [2019-10-02 11:03:44,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:03:44,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:03:44,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:03:45,001 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 113 [2019-10-02 11:03:45,003 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 11:03:45,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:45,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:03:45,049 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:563, output treesize:85 [2019-10-02 11:03:45,179 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:45,179 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 79 treesize of output 42 [2019-10-02 11:03:45,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:03:45,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:45,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:03:45,198 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-10-02 11:03:45,199 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:03:45,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:45,208 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:03:45,208 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:21 [2019-10-02 11:03:45,286 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 22 treesize of output 10 [2019-10-02 11:03:45,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:03:45,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:03:45,299 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:03:45,300 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2019-10-02 11:03:45,373 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:03:45,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:03:45,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 41 [2019-10-02 11:03:45,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-02 11:03:45,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-02 11:03:45,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1505, Unknown=10, NotChecked=0, Total=1640 [2019-10-02 11:03:45,380 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand 41 states. [2019-10-02 11:03:45,832 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-10-02 11:03:57,036 WARN L191 SmtUtils]: Spent 856.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-10-02 11:04:01,350 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-10-02 11:04:25,101 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 86 [2019-10-02 11:04:26,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:04:26,098 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2019-10-02 11:04:26,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 11:04:26,099 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 50 [2019-10-02 11:04:26,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:04:26,100 INFO L225 Difference]: With dead ends: 69 [2019-10-02 11:04:26,102 INFO L226 Difference]: Without dead ends: 67 [2019-10-02 11:04:26,103 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=207, Invalid=2537, Unknown=12, NotChecked=0, Total=2756 [2019-10-02 11:04:26,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-02 11:04:26,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2019-10-02 11:04:26,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-02 11:04:26,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2019-10-02 11:04:26,121 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 50 [2019-10-02 11:04:26,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:04:26,122 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2019-10-02 11:04:26,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-02 11:04:26,122 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2019-10-02 11:04:26,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 11:04:26,125 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:04:26,125 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, 1] [2019-10-02 11:04:26,125 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:04:26,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:04:26,126 INFO L82 PathProgramCache]: Analyzing trace with hash -450809231, now seen corresponding path program 1 times [2019-10-02 11:04:26,126 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:04:26,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:04:26,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:04:26,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:04:26,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:04:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:04:26,464 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:04:26,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:04:26,464 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:04:26,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:04:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:04:26,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-02 11:04:26,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:04:26,730 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:26,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:04:26,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:04:26,736 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:26,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-02 11:04:28,778 WARN L860 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset Int) (node_create_~temp~0.base Int)) (and (<= (+ |c_#StackHeapBarrier| 1) node_create_~temp~0.base) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset (select (select |c_#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset)))))) is different from true