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-112bae1 [2019-09-08 02:08:33,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 02:08:33,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 02:08:33,461 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 02:08:33,461 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 02:08:33,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 02:08:33,465 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 02:08:33,480 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 02:08:33,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 02:08:33,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 02:08:33,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 02:08:33,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 02:08:33,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 02:08:33,492 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 02:08:33,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 02:08:33,497 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 02:08:33,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 02:08:33,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 02:08:33,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 02:08:33,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 02:08:33,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 02:08:33,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 02:08:33,515 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 02:08:33,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 02:08:33,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 02:08:33,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 02:08:33,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 02:08:33,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 02:08:33,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 02:08:33,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 02:08:33,525 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 02:08:33,527 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 02:08:33,528 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 02:08:33,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 02:08:33,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 02:08:33,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 02:08:33,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 02:08:33,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 02:08:33,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 02:08:33,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 02:08:33,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 02:08:33,533 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-09-08 02:08:33,550 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 02:08:33,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 02:08:33,553 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 02:08:33,553 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 02:08:33,553 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 02:08:33,553 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 02:08:33,554 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 02:08:33,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 02:08:33,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 02:08:33,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 02:08:33,556 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 02:08:33,556 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 02:08:33,556 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 02:08:33,556 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 02:08:33,557 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 02:08:33,557 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 02:08:33,557 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 02:08:33,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 02:08:33,558 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 02:08:33,558 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 02:08:33,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 02:08:33,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:08:33,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 02:08:33,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 02:08:33,559 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 02:08:33,559 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 02:08:33,560 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 02:08:33,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 02:08:33,560 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 02:08:33,612 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 02:08:33,629 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 02:08:33,633 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 02:08:33,635 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 02:08:33,635 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 02:08:33,636 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-09-08 02:08:33,706 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da9015f41/975670be666342b4825c6c91c59d9025/FLAG6f2543d6e [2019-09-08 02:08:34,310 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 02:08:34,311 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_insert_unequal.i [2019-09-08 02:08:34,324 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da9015f41/975670be666342b4825c6c91c59d9025/FLAG6f2543d6e [2019-09-08 02:08:34,577 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da9015f41/975670be666342b4825c6c91c59d9025 [2019-09-08 02:08:34,591 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 02:08:34,593 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 02:08:34,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 02:08:34,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 02:08:34,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 02:08:34,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:08:34" (1/1) ... [2019-09-08 02:08:34,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ab4ac59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:08:34, skipping insertion in model container [2019-09-08 02:08:34,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:08:34" (1/1) ... [2019-09-08 02:08:34,610 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 02:08:34,670 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 02:08:35,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:08:35,138 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 02:08:35,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:08:35,286 INFO L192 MainTranslator]: Completed translation [2019-09-08 02:08:35,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:08:35 WrapperNode [2019-09-08 02:08:35,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 02:08:35,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 02:08:35,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 02:08:35,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 02:08:35,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:08:35" (1/1) ... [2019-09-08 02:08:35,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:08:35" (1/1) ... [2019-09-08 02:08:35,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:08:35" (1/1) ... [2019-09-08 02:08:35,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:08:35" (1/1) ... [2019-09-08 02:08:35,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:08:35" (1/1) ... [2019-09-08 02:08:35,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:08:35" (1/1) ... [2019-09-08 02:08:35,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:08:35" (1/1) ... [2019-09-08 02:08:35,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 02:08:35,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 02:08:35,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 02:08:35,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 02:08:35,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:08:35" (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-09-08 02:08:35,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 02:08:35,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 02:08:35,419 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-09-08 02:08:35,419 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-09-08 02:08:35,419 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-09-08 02:08:35,419 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-09-08 02:08:35,419 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-09-08 02:08:35,420 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2019-09-08 02:08:35,420 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2019-09-08 02:08:35,420 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 02:08:35,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 02:08:35,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 02:08:35,421 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-09-08 02:08:35,421 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-09-08 02:08:35,421 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-08 02:08:35,421 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-08 02:08:35,422 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-08 02:08:35,422 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-08 02:08:35,422 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-08 02:08:35,422 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-08 02:08:35,423 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-08 02:08:35,423 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-08 02:08:35,423 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-08 02:08:35,423 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-08 02:08:35,423 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-08 02:08:35,424 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-08 02:08:35,424 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-08 02:08:35,424 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-08 02:08:35,424 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-08 02:08:35,424 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-08 02:08:35,424 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-08 02:08:35,425 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-08 02:08:35,425 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-08 02:08:35,425 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-08 02:08:35,425 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-08 02:08:35,425 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-08 02:08:35,426 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-08 02:08:35,426 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-08 02:08:35,426 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-08 02:08:35,426 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-08 02:08:35,426 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-08 02:08:35,427 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-08 02:08:35,427 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-08 02:08:35,427 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-08 02:08:35,427 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-08 02:08:35,427 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-08 02:08:35,428 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-08 02:08:35,428 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-08 02:08:35,428 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-08 02:08:35,428 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-08 02:08:35,428 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-08 02:08:35,428 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-08 02:08:35,428 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-08 02:08:35,429 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-08 02:08:35,429 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-08 02:08:35,429 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-08 02:08:35,429 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-08 02:08:35,429 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-08 02:08:35,429 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-08 02:08:35,430 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-08 02:08:35,430 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-08 02:08:35,430 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-08 02:08:35,430 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-08 02:08:35,430 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-08 02:08:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 02:08:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-08 02:08:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-08 02:08:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 02:08:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-08 02:08:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-08 02:08:35,432 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-08 02:08:35,432 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-08 02:08:35,432 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-08 02:08:35,432 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-08 02:08:35,432 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-08 02:08:35,432 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-08 02:08:35,433 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-08 02:08:35,433 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 02:08:35,433 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-08 02:08:35,433 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-08 02:08:35,433 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-08 02:08:35,433 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-08 02:08:35,434 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-08 02:08:35,434 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-08 02:08:35,434 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-08 02:08:35,434 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-08 02:08:35,434 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-08 02:08:35,434 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-08 02:08:35,434 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-08 02:08:35,435 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-08 02:08:35,435 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-08 02:08:35,435 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-08 02:08:35,435 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-08 02:08:35,435 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-08 02:08:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-08 02:08:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-08 02:08:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-08 02:08:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-08 02:08:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-08 02:08:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-08 02:08:35,437 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-08 02:08:35,437 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-08 02:08:35,437 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-08 02:08:35,437 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-08 02:08:35,437 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-08 02:08:35,437 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-08 02:08:35,438 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-08 02:08:35,438 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-08 02:08:35,438 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-08 02:08:35,438 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-08 02:08:35,438 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-08 02:08:35,438 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-08 02:08:35,438 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-08 02:08:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-08 02:08:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-08 02:08:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-08 02:08:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-08 02:08:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-09-08 02:08:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-09-08 02:08:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 02:08:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 02:08:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 02:08:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-09-08 02:08:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2019-09-08 02:08:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 02:08:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 02:08:35,441 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2019-09-08 02:08:35,441 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 02:08:35,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 02:08:35,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-08 02:08:35,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 02:08:35,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 02:08:35,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 02:08:35,766 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-09-08 02:08:36,017 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 02:08:36,018 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-09-08 02:08:36,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:08:36 BoogieIcfgContainer [2019-09-08 02:08:36,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 02:08:36,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 02:08:36,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 02:08:36,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 02:08:36,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:08:34" (1/3) ... [2019-09-08 02:08:36,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8d6ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:08:36, skipping insertion in model container [2019-09-08 02:08:36,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:08:35" (2/3) ... [2019-09-08 02:08:36,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8d6ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:08:36, skipping insertion in model container [2019-09-08 02:08:36,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:08:36" (3/3) ... [2019-09-08 02:08:36,028 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2019-09-08 02:08:36,039 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 02:08:36,048 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 02:08:36,066 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 02:08:36,100 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 02:08:36,101 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 02:08:36,101 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 02:08:36,101 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 02:08:36,101 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 02:08:36,101 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 02:08:36,101 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 02:08:36,102 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 02:08:36,102 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 02:08:36,123 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-09-08 02:08:36,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-08 02:08:36,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:08:36,132 INFO L399 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-09-08 02:08:36,134 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:08:36,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:08:36,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1925718240, now seen corresponding path program 1 times [2019-09-08 02:08:36,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:08:36,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:08:36,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:08:36,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:08:36,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:08:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:08:36,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:08:36,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:08:36,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 02:08:36,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 02:08:36,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 02:08:36,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 02:08:36,349 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 2 states. [2019-09-08 02:08:36,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:08:36,387 INFO L93 Difference]: Finished difference Result 94 states and 125 transitions. [2019-09-08 02:08:36,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 02:08:36,388 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2019-09-08 02:08:36,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:08:36,402 INFO L225 Difference]: With dead ends: 94 [2019-09-08 02:08:36,403 INFO L226 Difference]: Without dead ends: 40 [2019-09-08 02:08:36,410 INFO L628 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-09-08 02:08:36,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-08 02:08:36,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-08 02:08:36,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-08 02:08:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-09-08 02:08:36,478 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 31 [2019-09-08 02:08:36,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:08:36,479 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-09-08 02:08:36,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 02:08:36,480 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-09-08 02:08:36,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-08 02:08:36,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:08:36,484 INFO L399 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-09-08 02:08:36,485 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:08:36,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:08:36,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1001067800, now seen corresponding path program 1 times [2019-09-08 02:08:36,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:08:36,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:08:36,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:08:36,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:08:36,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:08:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:08:36,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:08:36,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:08:36,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 02:08:36,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 02:08:36,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 02:08:36,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:08:36,702 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 3 states. [2019-09-08 02:08:36,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:08:36,732 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2019-09-08 02:08:36,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 02:08:36,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-08 02:08:36,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:08:36,737 INFO L225 Difference]: With dead ends: 58 [2019-09-08 02:08:36,737 INFO L226 Difference]: Without dead ends: 45 [2019-09-08 02:08:36,738 INFO L628 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-09-08 02:08:36,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-08 02:08:36,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-09-08 02:08:36,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-08 02:08:36,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2019-09-08 02:08:36,758 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 31 [2019-09-08 02:08:36,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:08:36,762 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2019-09-08 02:08:36,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 02:08:36,762 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2019-09-08 02:08:36,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-08 02:08:36,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:08:36,765 INFO L399 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-09-08 02:08:36,766 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:08:36,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:08:36,767 INFO L82 PathProgramCache]: Analyzing trace with hash 191721174, now seen corresponding path program 1 times [2019-09-08 02:08:36,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:08:36,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:08:36,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:08:36,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:08:36,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:08:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:08:36,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:08:36,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:08:36,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:08:36,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:08:36,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:08:36,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:08:36,877 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 5 states. [2019-09-08 02:08:36,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:08:36,950 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2019-09-08 02:08:36,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:08:36,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-09-08 02:08:36,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:08:36,954 INFO L225 Difference]: With dead ends: 76 [2019-09-08 02:08:36,956 INFO L226 Difference]: Without dead ends: 46 [2019-09-08 02:08:36,957 INFO L628 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-09-08 02:08:36,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-08 02:08:36,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-09-08 02:08:36,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-08 02:08:36,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-09-08 02:08:36,968 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 31 [2019-09-08 02:08:36,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:08:36,969 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-09-08 02:08:36,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:08:36,971 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2019-09-08 02:08:36,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 02:08:36,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:08:36,975 INFO L399 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-09-08 02:08:36,976 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:08:36,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:08:36,976 INFO L82 PathProgramCache]: Analyzing trace with hash -833744621, now seen corresponding path program 1 times [2019-09-08 02:08:36,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:08:36,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:08:36,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:08:36,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:08:36,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:08:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:08:37,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 02:08:37,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:08:37,099 INFO L223 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-09-08 02:08:37,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:08:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:08:37,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 02:08:37,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:08:37,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:08:37,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:08:37,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-08 02:08:37,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 02:08:37,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 02:08:37,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:08:37,246 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 6 states. [2019-09-08 02:08:37,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:08:37,338 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2019-09-08 02:08:37,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:08:37,339 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-09-08 02:08:37,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:08:37,341 INFO L225 Difference]: With dead ends: 80 [2019-09-08 02:08:37,341 INFO L226 Difference]: Without dead ends: 50 [2019-09-08 02:08:37,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 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-09-08 02:08:37,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-08 02:08:37,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-09-08 02:08:37,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-08 02:08:37,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2019-09-08 02:08:37,351 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 40 [2019-09-08 02:08:37,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:08:37,352 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2019-09-08 02:08:37,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 02:08:37,352 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2019-09-08 02:08:37,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-08 02:08:37,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:08:37,354 INFO L399 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-09-08 02:08:37,354 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:08:37,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:08:37,355 INFO L82 PathProgramCache]: Analyzing trace with hash -159145098, now seen corresponding path program 2 times [2019-09-08 02:08:37,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:08:37,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:08:37,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:08:37,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:08:37,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:08:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:08:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 02:08:37,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:08:37,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 02:08:37,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 02:08:37,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 02:08:37,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:08:37,498 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand 6 states. [2019-09-08 02:08:37,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:08:37,573 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2019-09-08 02:08:37,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:08:37,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-09-08 02:08:37,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:08:37,575 INFO L225 Difference]: With dead ends: 60 [2019-09-08 02:08:37,575 INFO L226 Difference]: Without dead ends: 46 [2019-09-08 02:08:37,576 INFO L628 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-09-08 02:08:37,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-08 02:08:37,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-08 02:08:37,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-08 02:08:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2019-09-08 02:08:37,583 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 49 [2019-09-08 02:08:37,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:08:37,583 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2019-09-08 02:08:37,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 02:08:37,584 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2019-09-08 02:08:37,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-08 02:08:37,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:08:37,585 INFO L399 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-09-08 02:08:37,585 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:08:37,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:08:37,586 INFO L82 PathProgramCache]: Analyzing trace with hash 358537395, now seen corresponding path program 1 times [2019-09-08 02:08:37,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:08:37,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:08:37,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:08:37,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 02:08:37,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:08:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:08:38,851 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-08 02:08:39,103 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-08 02:08:39,380 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-08 02:08:39,741 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-09-08 02:08:40,140 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-09-08 02:08:40,326 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 02:08:40,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:08:40,327 INFO L223 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-09-08 02:08:40,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:08:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:08:40,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 121 conjunts are in the unsatisfiable core [2019-09-08 02:08:40,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:08:40,569 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-09-08 02:08:40,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:08:40,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:08:40,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:08:40,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-08 02:08:40,646 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-09-08 02:08:40,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:08:40,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:08:40,655 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:08:40,655 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-09-08 02:08:40,797 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-09-08 02:08:40,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:08:40,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:08:40,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:08:40,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2019-09-08 02:08:41,162 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-09-08 02:08:41,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:08:41,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:08:41,190 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-09-08 02:08:41,192 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:08:41,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:08:41,224 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-09-08 02:08:41,226 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:08:41,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:08:41,250 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-09-08 02:08:41,250 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:08:41,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:08:41,262 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-09-08 02:08:41,262 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:61, output treesize:13 [2019-09-08 02:08:41,394 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:08:41,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:08:41,414 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-09-08 02:08:41,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:82, output treesize:68 [2019-09-08 02:08:42,409 WARN L188 SmtUtils]: Spent 904.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-09-08 02:08:43,599 WARN L188 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 46 [2019-09-08 02:08:44,509 WARN L188 SmtUtils]: Spent 802.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-09-08 02:08:45,708 WARN L188 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 50 [2019-09-08 02:08:45,737 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:08:45,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:08:45,793 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:08:45,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:08:45,855 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-09-08 02:08:45,856 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:167, output treesize:322 [2019-09-08 02:08:50,062 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:08:50,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:08:50,129 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-09-08 02:08:50,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:470, output treesize:508 [2019-09-08 02:09:09,222 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-09-08 02:09:09,256 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:09:09,256 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-09-08 02:09:09,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:09:09,420 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-09-08 02:09:09,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:09:09,423 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-09-08 02:09:09,436 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 02:09:09,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:09:09,444 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-09-08 02:09:09,446 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:09:09,557 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-09-08 02:09:09,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:09:09,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:09:09,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:09:09,699 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-08 02:09:09,700 INFO L341 Elim1Store]: treesize reduction 33, result has 85.7 percent of original size [2019-09-08 02:09:09,701 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-09-08 02:09:09,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:09:09,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:09:09,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:09:09,710 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:09:10,034 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-09-08 02:09:10,034 INFO L567 ElimStorePlain]: treesize reduction 486, result has 34.6 percent of original size [2019-09-08 02:09:10,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:09:10,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:09:10,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:09:10,053 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-09-08 02:09:10,054 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:09:10,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:09:10,104 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-09-08 02:09:10,104 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:563, output treesize:85 [2019-09-08 02:09:10,231 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:09:10,232 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-09-08 02:09:10,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:09:10,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:09:10,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:09:10,253 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-09-08 02:09:10,254 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:09:10,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:09:10,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:09:10,270 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:21 [2019-09-08 02:09:10,361 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-09-08 02:09:10,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:09:10,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:09:10,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:09:10,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2019-09-08 02:09:10,425 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 02:09:10,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:09:10,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 41 [2019-09-08 02:09:10,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-08 02:09:10,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-08 02:09:10,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1504, Unknown=11, NotChecked=0, Total=1640 [2019-09-08 02:09:10,432 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand 41 states. [2019-09-08 02:09:10,867 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-09-08 02:09:22,482 WARN L188 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 55 [2019-09-08 02:09:26,808 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-09-08 02:09:50,747 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 95 [2019-09-08 02:09:51,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:09:51,695 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2019-09-08 02:09:51,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 02:09:51,695 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 50 [2019-09-08 02:09:51,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:09:51,697 INFO L225 Difference]: With dead ends: 69 [2019-09-08 02:09:51,698 INFO L226 Difference]: Without dead ends: 67 [2019-09-08 02:09:51,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 37.1s TimeCoverageRelationStatistics Valid=207, Invalid=2536, Unknown=13, NotChecked=0, Total=2756 [2019-09-08 02:09:51,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-08 02:09:51,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2019-09-08 02:09:51,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-08 02:09:51,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2019-09-08 02:09:51,710 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 50 [2019-09-08 02:09:51,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:09:51,711 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2019-09-08 02:09:51,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-08 02:09:51,711 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2019-09-08 02:09:51,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-08 02:09:51,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:09:51,712 INFO L399 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-09-08 02:09:51,713 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:09:51,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:09:51,713 INFO L82 PathProgramCache]: Analyzing trace with hash -450809231, now seen corresponding path program 1 times [2019-09-08 02:09:51,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:09:51,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:09:51,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:09:51,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:09:51,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:09:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:09:52,002 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 02:09:52,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:09:52,002 INFO L223 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-09-08 02:09:52,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:09:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:09:52,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-08 02:09:52,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:09:52,215 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-09-08 02:09:52,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:09:52,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:09:52,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:09:52,221 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-08 02:09:54,277 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