/usr/bin/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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/forester-heap/sll-queue-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 02:09:08,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 02:09:08,496 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 02:09:08,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 02:09:08,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 02:09:08,517 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 02:09:08,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 02:09:08,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 02:09:08,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 02:09:08,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 02:09:08,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 02:09:08,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 02:09:08,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 02:09:08,533 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 02:09:08,535 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 02:09:08,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 02:09:08,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 02:09:08,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 02:09:08,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 02:09:08,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 02:09:08,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 02:09:08,544 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 02:09:08,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 02:09:08,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 02:09:08,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 02:09:08,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 02:09:08,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 02:09:08,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 02:09:08,550 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 02:09:08,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 02:09:08,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 02:09:08,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 02:09:08,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 02:09:08,553 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 02:09:08,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 02:09:08,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 02:09:08,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 02:09:08,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 02:09:08,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 02:09:08,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 02:09:08,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 02:09:08,558 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-11-07 02:09:08,572 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 02:09:08,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 02:09:08,573 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 02:09:08,573 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 02:09:08,574 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 02:09:08,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 02:09:08,574 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 02:09:08,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 02:09:08,574 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 02:09:08,575 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 02:09:08,575 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 02:09:08,575 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 02:09:08,575 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 02:09:08,575 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 02:09:08,576 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 02:09:08,576 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 02:09:08,576 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 02:09:08,576 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 02:09:08,576 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 02:09:08,577 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 02:09:08,577 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 02:09:08,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 02:09:08,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 02:09:08,577 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 02:09:08,578 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 02:09:08,578 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 02:09:08,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 02:09:08,578 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 02:09:08,578 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-11-07 02:09:08,847 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 02:09:08,860 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 02:09:08,863 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 02:09:08,865 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 02:09:08,865 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 02:09:08,866 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-queue-1.i [2019-11-07 02:09:08,929 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9053e356/a948b9c620e7413fb8bef9205da4a792/FLAG1130da4f4 [2019-11-07 02:09:09,518 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 02:09:09,519 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-queue-1.i [2019-11-07 02:09:09,539 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9053e356/a948b9c620e7413fb8bef9205da4a792/FLAG1130da4f4 [2019-11-07 02:09:09,909 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9053e356/a948b9c620e7413fb8bef9205da4a792 [2019-11-07 02:09:09,925 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 02:09:09,927 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 02:09:09,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 02:09:09,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 02:09:09,931 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 02:09:09,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:09:09" (1/1) ... [2019-11-07 02:09:09,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4170af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:09:09, skipping insertion in model container [2019-11-07 02:09:09,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:09:09" (1/1) ... [2019-11-07 02:09:09,943 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 02:09:09,997 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 02:09:10,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 02:09:10,442 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 02:09:10,492 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 02:09:10,557 INFO L192 MainTranslator]: Completed translation [2019-11-07 02:09:10,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:09:10 WrapperNode [2019-11-07 02:09:10,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 02:09:10,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 02:09:10,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 02:09:10,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 02:09:10,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:09:10" (1/1) ... [2019-11-07 02:09:10,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:09:10" (1/1) ... [2019-11-07 02:09:10,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:09:10" (1/1) ... [2019-11-07 02:09:10,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:09:10" (1/1) ... [2019-11-07 02:09:10,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:09:10" (1/1) ... [2019-11-07 02:09:10,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:09:10" (1/1) ... [2019-11-07 02:09:10,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:09:10" (1/1) ... [2019-11-07 02:09:10,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 02:09:10,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 02:09:10,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 02:09:10,632 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 02:09:10,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:09:10" (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-11-07 02:09:10,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 02:09:10,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 02:09:10,692 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 02:09:10,692 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-07 02:09:10,692 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-07 02:09:10,693 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-07 02:09:10,693 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-07 02:09:10,693 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-07 02:09:10,693 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-07 02:09:10,693 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-07 02:09:10,693 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-07 02:09:10,694 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-07 02:09:10,694 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-07 02:09:10,694 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-07 02:09:10,694 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-07 02:09:10,694 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-07 02:09:10,695 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-07 02:09:10,695 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-07 02:09:10,695 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-07 02:09:10,695 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-07 02:09:10,695 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-07 02:09:10,695 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-07 02:09:10,695 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-07 02:09:10,696 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-07 02:09:10,696 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-07 02:09:10,696 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-07 02:09:10,696 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-07 02:09:10,696 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-07 02:09:10,697 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-07 02:09:10,697 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-07 02:09:10,697 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-07 02:09:10,697 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-07 02:09:10,697 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-07 02:09:10,697 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-07 02:09:10,698 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-07 02:09:10,698 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-07 02:09:10,698 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-07 02:09:10,698 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-07 02:09:10,698 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-07 02:09:10,698 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-07 02:09:10,699 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-07 02:09:10,699 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-07 02:09:10,699 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-07 02:09:10,699 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-07 02:09:10,699 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-07 02:09:10,699 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-07 02:09:10,699 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-07 02:09:10,700 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-07 02:09:10,700 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-07 02:09:10,700 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-07 02:09:10,700 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-07 02:09:10,700 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-07 02:09:10,700 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-07 02:09:10,701 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-07 02:09:10,701 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-07 02:09:10,701 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-07 02:09:10,701 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-07 02:09:10,701 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-07 02:09:10,701 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-07 02:09:10,702 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-07 02:09:10,702 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-07 02:09:10,702 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-07 02:09:10,702 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-07 02:09:10,702 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-07 02:09:10,702 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-07 02:09:10,703 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-07 02:09:10,703 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-07 02:09:10,703 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-07 02:09:10,703 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-07 02:09:10,703 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-07 02:09:10,703 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-07 02:09:10,703 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-07 02:09:10,704 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-07 02:09:10,704 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-07 02:09:10,704 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-07 02:09:10,704 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-07 02:09:10,704 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-07 02:09:10,704 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-07 02:09:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-07 02:09:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-07 02:09:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-07 02:09:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-07 02:09:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-07 02:09:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-07 02:09:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-07 02:09:10,706 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-07 02:09:10,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-07 02:09:10,706 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-07 02:09:10,706 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-07 02:09:10,706 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-07 02:09:10,706 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-07 02:09:10,707 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-07 02:09:10,707 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-07 02:09:10,707 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-07 02:09:10,707 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-07 02:09:10,707 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-07 02:09:10,707 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-07 02:09:10,707 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-07 02:09:10,707 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-07 02:09:10,708 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-07 02:09:10,708 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-07 02:09:10,708 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-07 02:09:10,708 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-07 02:09:10,708 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-07 02:09:10,708 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-07 02:09:10,708 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-07 02:09:10,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 02:09:10,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 02:09:10,709 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 02:09:10,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-07 02:09:10,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-07 02:09:10,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-07 02:09:10,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-07 02:09:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-07 02:09:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-07 02:09:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 02:09:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 02:09:11,554 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 02:09:11,555 INFO L284 CfgBuilder]: Removed 31 assume(true) statements. [2019-11-07 02:09:11,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:09:11 BoogieIcfgContainer [2019-11-07 02:09:11,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 02:09:11,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 02:09:11,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 02:09:11,561 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 02:09:11,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:09:09" (1/3) ... [2019-11-07 02:09:11,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbce3ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:09:11, skipping insertion in model container [2019-11-07 02:09:11,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:09:10" (2/3) ... [2019-11-07 02:09:11,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbce3ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:09:11, skipping insertion in model container [2019-11-07 02:09:11,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:09:11" (3/3) ... [2019-11-07 02:09:11,565 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-queue-1.i [2019-11-07 02:09:11,573 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 02:09:11,581 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-11-07 02:09:11,591 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-11-07 02:09:11,617 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 02:09:11,618 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 02:09:11,618 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 02:09:11,618 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 02:09:11,619 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 02:09:11,619 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 02:09:11,619 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 02:09:11,619 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 02:09:11,641 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2019-11-07 02:09:11,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-07 02:09:11,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:09:11,650 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:09:11,652 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:09:11,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:09:11,659 INFO L82 PathProgramCache]: Analyzing trace with hash -720600283, now seen corresponding path program 1 times [2019-11-07 02:09:11,669 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:09:11,669 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919520584] [2019-11-07 02:09:11,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:09:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:09:11,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:09:11,865 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919520584] [2019-11-07 02:09:11,866 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 02:09:11,866 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-07 02:09:11,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330177528] [2019-11-07 02:09:11,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-07 02:09:11,873 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:09:11,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-07 02:09:11,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-07 02:09:11,890 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 2 states. [2019-11-07 02:09:11,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:09:11,932 INFO L93 Difference]: Finished difference Result 159 states and 257 transitions. [2019-11-07 02:09:11,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-07 02:09:11,937 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-07 02:09:11,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:09:11,951 INFO L225 Difference]: With dead ends: 159 [2019-11-07 02:09:11,951 INFO L226 Difference]: Without dead ends: 78 [2019-11-07 02:09:11,959 INFO L630 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-11-07 02:09:11,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-07 02:09:12,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-07 02:09:12,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-07 02:09:12,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2019-11-07 02:09:12,015 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 8 [2019-11-07 02:09:12,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:09:12,015 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2019-11-07 02:09:12,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-07 02:09:12,016 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2019-11-07 02:09:12,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-07 02:09:12,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:09:12,016 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:09:12,017 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:09:12,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:09:12,017 INFO L82 PathProgramCache]: Analyzing trace with hash -865198600, now seen corresponding path program 1 times [2019-11-07 02:09:12,017 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:09:12,018 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206219637] [2019-11-07 02:09:12,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:09:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:09:12,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:09:12,121 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206219637] [2019-11-07 02:09:12,121 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 02:09:12,121 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 02:09:12,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754635104] [2019-11-07 02:09:12,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 02:09:12,124 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:09:12,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 02:09:12,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 02:09:12,125 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 3 states. [2019-11-07 02:09:12,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:09:12,200 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2019-11-07 02:09:12,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 02:09:12,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-07 02:09:12,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:09:12,202 INFO L225 Difference]: With dead ends: 78 [2019-11-07 02:09:12,202 INFO L226 Difference]: Without dead ends: 68 [2019-11-07 02:09:12,204 INFO L630 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-11-07 02:09:12,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-07 02:09:12,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-07 02:09:12,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-07 02:09:12,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-11-07 02:09:12,221 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 9 [2019-11-07 02:09:12,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:09:12,221 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-11-07 02:09:12,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 02:09:12,221 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-11-07 02:09:12,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-07 02:09:12,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:09:12,223 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:09:12,224 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:09:12,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:09:12,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1767928316, now seen corresponding path program 1 times [2019-11-07 02:09:12,225 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:09:12,225 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826252366] [2019-11-07 02:09:12,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:09:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:09:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:09:12,342 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826252366] [2019-11-07 02:09:12,343 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 02:09:12,343 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 02:09:12,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30931316] [2019-11-07 02:09:12,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 02:09:12,346 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:09:12,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 02:09:12,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 02:09:12,347 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 3 states. [2019-11-07 02:09:12,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:09:12,392 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-11-07 02:09:12,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 02:09:12,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-07 02:09:12,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:09:12,395 INFO L225 Difference]: With dead ends: 68 [2019-11-07 02:09:12,395 INFO L226 Difference]: Without dead ends: 66 [2019-11-07 02:09:12,396 INFO L630 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-11-07 02:09:12,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-07 02:09:12,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-07 02:09:12,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-07 02:09:12,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-11-07 02:09:12,409 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 11 [2019-11-07 02:09:12,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:09:12,410 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-11-07 02:09:12,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 02:09:12,410 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-11-07 02:09:12,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 02:09:12,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:09:12,412 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:09:12,413 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:09:12,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:09:12,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1429193867, now seen corresponding path program 1 times [2019-11-07 02:09:12,413 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:09:12,413 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779615355] [2019-11-07 02:09:12,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:09:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:09:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:09:12,485 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779615355] [2019-11-07 02:09:12,486 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 02:09:12,486 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 02:09:12,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579771993] [2019-11-07 02:09:12,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 02:09:12,487 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:09:12,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 02:09:12,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 02:09:12,487 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 3 states. [2019-11-07 02:09:12,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:09:12,532 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2019-11-07 02:09:12,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 02:09:12,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-07 02:09:12,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:09:12,534 INFO L225 Difference]: With dead ends: 134 [2019-11-07 02:09:12,534 INFO L226 Difference]: Without dead ends: 82 [2019-11-07 02:09:12,535 INFO L630 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-11-07 02:09:12,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-07 02:09:12,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 73. [2019-11-07 02:09:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-07 02:09:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2019-11-07 02:09:12,543 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 15 [2019-11-07 02:09:12,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:09:12,544 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2019-11-07 02:09:12,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 02:09:12,544 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2019-11-07 02:09:12,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 02:09:12,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:09:12,545 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:09:12,545 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:09:12,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:09:12,546 INFO L82 PathProgramCache]: Analyzing trace with hash -532951263, now seen corresponding path program 1 times [2019-11-07 02:09:12,546 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:09:12,546 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225408319] [2019-11-07 02:09:12,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:09:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:09:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:09:12,603 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225408319] [2019-11-07 02:09:12,603 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 02:09:12,603 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 02:09:12,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71409782] [2019-11-07 02:09:12,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 02:09:12,604 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:09:12,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 02:09:12,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 02:09:12,605 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 4 states. [2019-11-07 02:09:12,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:09:12,669 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2019-11-07 02:09:12,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 02:09:12,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-07 02:09:12,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:09:12,671 INFO L225 Difference]: With dead ends: 82 [2019-11-07 02:09:12,671 INFO L226 Difference]: Without dead ends: 68 [2019-11-07 02:09:12,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 02:09:12,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-07 02:09:12,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-07 02:09:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-07 02:09:12,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-11-07 02:09:12,678 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 18 [2019-11-07 02:09:12,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:09:12,679 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-11-07 02:09:12,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 02:09:12,679 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-11-07 02:09:12,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 02:09:12,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:09:12,680 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:09:12,681 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:09:12,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:09:12,681 INFO L82 PathProgramCache]: Analyzing trace with hash 449795544, now seen corresponding path program 1 times [2019-11-07 02:09:12,682 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:09:12,682 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755388608] [2019-11-07 02:09:12,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:09:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:09:12,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:09:12,828 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755388608] [2019-11-07 02:09:12,829 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220049281] [2019-11-07 02:09:12,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 02:09:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:09:12,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-07 02:09:12,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 02:09:13,007 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-11-07 02:09:13,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 02:09:13,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:13,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-07 02:09:13,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-07 02:09:13,065 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:13,065 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-07 02:09:13,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 02:09:13,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:13,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:09:13,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2019-11-07 02:09:13,102 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-07 02:09:13,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:13,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-07 02:09:13,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2019-11-07 02:09:13,131 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-07 02:09:13,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:13,153 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-07 02:09:13,154 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-07 02:09:13,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:13,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 02:09:13,167 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:91, output treesize:28 [2019-11-07 02:09:13,228 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:13,228 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2019-11-07 02:09:13,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 02:09:13,243 INFO L567 ElimStorePlain]: treesize reduction 12, result has 42.9 percent of original size [2019-11-07 02:09:13,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 02:09:13,245 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-11-07 02:09:13,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:09:13,252 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 02:09:13,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:13,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:13,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:13,308 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_8, v_prenex_10, |#memory_$Pointer$.base|, |#memory_$Pointer$.offset|, v_prenex_14, |v_#memory_$Pointer$.offset_40|, v_prenex_17, v_prenex_15, v_prenex_7], 2=[|v_#memory_$Pointer$.base_40|, v_prenex_12, v_prenex_2, v_prenex_5]} [2019-11-07 02:09:13,324 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-07 02:09:13,422 INFO L341 Elim1Store]: treesize reduction 49, result has 43.7 percent of original size [2019-11-07 02:09:13,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 104 [2019-11-07 02:09:13,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 02:09:15,255 WARN L191 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 157 DAG size of output: 157 [2019-11-07 02:09:15,255 INFO L567 ElimStorePlain]: treesize reduction 9, result has 97.5 percent of original size [2019-11-07 02:09:15,332 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:15,332 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 1 case distinctions, treesize of input 98 treesize of output 105 [2019-11-07 02:09:15,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:09:15,334 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-07 02:09:15,787 WARN L191 SmtUtils]: Spent 452.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-11-07 02:09:15,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:15,800 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-07 02:09:15,880 INFO L341 Elim1Store]: treesize reduction 49, result has 43.7 percent of original size [2019-11-07 02:09:15,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 98 [2019-11-07 02:09:15,882 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-07 02:09:16,414 WARN L191 SmtUtils]: Spent 530.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-11-07 02:09:16,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:16,435 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-07 02:09:16,516 INFO L341 Elim1Store]: treesize reduction 49, result has 43.7 percent of original size [2019-11-07 02:09:16,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 96 [2019-11-07 02:09:16,518 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-07 02:09:16,797 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2019-11-07 02:09:16,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:16,814 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-07 02:09:16,884 INFO L341 Elim1Store]: treesize reduction 49, result has 43.7 percent of original size [2019-11-07 02:09:16,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 98 [2019-11-07 02:09:16,885 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-07 02:09:17,179 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2019-11-07 02:09:17,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:17,208 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:17,209 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 1 case distinctions, treesize of input 96 treesize of output 103 [2019-11-07 02:09:17,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:17,210 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-07 02:09:17,485 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-11-07 02:09:17,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:17,494 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-07 02:09:17,674 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-11-07 02:09:17,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:17,675 INFO L464 ElimStorePlain]: Eliminatee v_prenex_15 vanished before elimination [2019-11-07 02:09:17,742 INFO L341 Elim1Store]: treesize reduction 76, result has 33.3 percent of original size [2019-11-07 02:09:17,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 59 [2019-11-07 02:09:17,744 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-07 02:09:17,880 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2019-11-07 02:09:17,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:17,917 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:17,917 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 92 [2019-11-07 02:09:17,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:17,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:09:17,920 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-07 02:09:18,202 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 118 [2019-11-07 02:09:18,203 INFO L567 ElimStorePlain]: treesize reduction 40, result has 84.3 percent of original size [2019-11-07 02:09:18,230 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:18,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 92 [2019-11-07 02:09:18,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:18,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:09:18,234 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-07 02:09:18,469 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 106 [2019-11-07 02:09:18,470 INFO L567 ElimStorePlain]: treesize reduction 39, result has 83.8 percent of original size [2019-11-07 02:09:18,493 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 149 treesize of output 141 [2019-11-07 02:09:18,495 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-07 02:09:18,800 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 102 [2019-11-07 02:09:18,801 INFO L567 ElimStorePlain]: treesize reduction 93, result has 66.8 percent of original size [2019-11-07 02:09:18,837 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 02:09:18,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 92 [2019-11-07 02:09:18,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:09:18,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:18,840 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-07 02:09:19,057 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 89 [2019-11-07 02:09:19,058 INFO L567 ElimStorePlain]: treesize reduction 21, result has 89.2 percent of original size [2019-11-07 02:09:19,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:19,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:09:19,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 02:09:19,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:19,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 02:09:19,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 13 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-11-07 02:09:19,068 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 24 variables, input treesize:361, output treesize:147 [2019-11-07 02:09:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:09:19,161 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [933787852] [2019-11-07 02:09:19,187 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-11-07 02:09:19,187 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 02:09:19,194 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 02:09:19,201 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 02:09:19,201 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 02:09:19,295 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-11-07 02:09:27,263 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-11-07 02:09:27,265 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 02:09:27,549 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 02:09:27,549 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 17 [2019-11-07 02:09:27,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161003707] [2019-11-07 02:09:27,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-07 02:09:27,551 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:09:27,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-07 02:09:27,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-11-07 02:09:27,552 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 17 states. [2019-11-07 02:09:28,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:09:28,889 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2019-11-07 02:09:28,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-07 02:09:28,890 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2019-11-07 02:09:28,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:09:28,892 INFO L225 Difference]: With dead ends: 159 [2019-11-07 02:09:28,892 INFO L226 Difference]: Without dead ends: 112 [2019-11-07 02:09:28,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2019-11-07 02:09:28,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-07 02:09:28,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 83. [2019-11-07 02:09:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-07 02:09:28,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2019-11-07 02:09:28,902 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 21 [2019-11-07 02:09:28,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:09:28,902 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2019-11-07 02:09:28,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-07 02:09:28,903 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2019-11-07 02:09:28,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-07 02:09:28,904 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:09:28,904 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:09:29,107 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 02:09:29,108 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:09:29,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:09:29,108 INFO L82 PathProgramCache]: Analyzing trace with hash 647748091, now seen corresponding path program 2 times [2019-11-07 02:09:29,109 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:09:29,109 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552990499] [2019-11-07 02:09:29,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:09:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:09:29,220 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:09:29,220 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552990499] [2019-11-07 02:09:29,221 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791223083] [2019-11-07 02:09:29,221 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 02:09:29,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-07 02:09:29,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 02:09:29,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-07 02:09:29,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 02:09:29,628 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:09:29,629 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 02:09:29,655 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:09:29,655 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1975462177] [2019-11-07 02:09:29,657 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-11-07 02:09:29,657 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 02:09:29,658 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 02:09:29,658 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 02:09:29,658 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 02:09:29,679 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-11-07 02:09:42,163 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-11-07 02:09:42,165 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 02:09:42,444 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 02:09:42,444 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4, 11] total 18 [2019-11-07 02:09:42,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466861277] [2019-11-07 02:09:42,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-07 02:09:42,446 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 02:09:42,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-07 02:09:42,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-11-07 02:09:42,447 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 18 states. [2019-11-07 02:09:43,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 02:09:43,638 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2019-11-07 02:09:43,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-07 02:09:43,638 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2019-11-07 02:09:43,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 02:09:43,640 INFO L225 Difference]: With dead ends: 147 [2019-11-07 02:09:43,640 INFO L226 Difference]: Without dead ends: 106 [2019-11-07 02:09:43,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=756, Unknown=0, NotChecked=0, Total=930 [2019-11-07 02:09:43,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-07 02:09:43,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 87. [2019-11-07 02:09:43,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-07 02:09:43,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2019-11-07 02:09:43,650 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 27 [2019-11-07 02:09:43,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 02:09:43,651 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2019-11-07 02:09:43,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-07 02:09:43,651 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2019-11-07 02:09:43,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-07 02:09:43,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 02:09:43,652 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 02:09:43,866 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 02:09:43,867 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 02:09:43,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 02:09:43,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1076935932, now seen corresponding path program 1 times [2019-11-07 02:09:43,867 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 02:09:43,868 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370006932] [2019-11-07 02:09:43,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 02:09:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:09:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:09:44,006 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370006932] [2019-11-07 02:09:44,006 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631181462] [2019-11-07 02:09:44,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 02:09:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 02:09:44,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-07 02:09:44,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 02:09:44,702 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-11-07 02:09:44,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 02:09:44,901 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 02:09:45,216 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 91 [2019-11-07 02:09:47,620 WARN L191 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 75 DAG size of output: 27