/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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/forester-heap/sll-queue-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:59:16,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:59:16,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:59:16,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:59:16,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:59:16,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:59:16,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:59:16,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:59:16,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:59:16,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:59:16,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:59:16,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:59:16,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:59:16,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:59:16,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:59:16,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:59:16,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:59:16,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:59:16,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:59:16,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:59:16,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:59:16,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:59:16,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:59:16,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:59:16,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:59:16,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:59:16,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:59:16,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:59:16,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:59:16,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:59:16,607 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:59:16,608 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:59:16,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:59:16,609 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:59:16,610 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:59:16,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:59:16,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:59:16,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:59:16,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:59:16,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:59:16,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:59:16,617 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-06 22:59:16,632 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:59:16,632 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:59:16,633 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:59:16,633 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:59:16,634 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:59:16,634 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:59:16,634 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:59:16,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:59:16,634 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:59:16,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:59:16,635 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:59:16,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:59:16,635 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:59:16,635 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:59:16,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:59:16,636 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:59:16,636 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:59:16,636 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:59:16,636 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:59:16,636 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:59:16,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:59:16,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:59:16,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:59:16,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:59:16,637 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:59:16,638 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:59:16,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:59:16,638 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:59:16,638 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-06 22:59:16,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:59:16,957 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:59:16,960 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:59:16,962 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:59:16,962 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:59:16,963 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-queue-2.i [2019-11-06 22:59:17,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14dc69ff8/92861f4ccec44351983f2ec1a235950c/FLAG211aeef39 [2019-11-06 22:59:17,559 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:59:17,559 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-queue-2.i [2019-11-06 22:59:17,577 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14dc69ff8/92861f4ccec44351983f2ec1a235950c/FLAG211aeef39 [2019-11-06 22:59:17,853 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14dc69ff8/92861f4ccec44351983f2ec1a235950c [2019-11-06 22:59:17,862 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:59:17,863 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:59:17,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:59:17,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:59:17,868 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:59:17,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:59:17" (1/1) ... [2019-11-06 22:59:17,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@523f6781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:17, skipping insertion in model container [2019-11-06 22:59:17,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:59:17" (1/1) ... [2019-11-06 22:59:17,880 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:59:17,931 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:59:18,377 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:59:18,391 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:59:18,449 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:59:18,497 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:59:18,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:18 WrapperNode [2019-11-06 22:59:18,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:59:18,499 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:59:18,499 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:59:18,499 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:59:18,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:18" (1/1) ... [2019-11-06 22:59:18,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:18" (1/1) ... [2019-11-06 22:59:18,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:18" (1/1) ... [2019-11-06 22:59:18,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:18" (1/1) ... [2019-11-06 22:59:18,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:18" (1/1) ... [2019-11-06 22:59:18,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:18" (1/1) ... [2019-11-06 22:59:18,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:18" (1/1) ... [2019-11-06 22:59:18,589 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:59:18,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:59:18,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:59:18,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:59:18,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:18" (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-06 22:59:18,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:59:18,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:59:18,655 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:59:18,655 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 22:59:18,655 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 22:59:18,655 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 22:59:18,655 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 22:59:18,656 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 22:59:18,656 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 22:59:18,656 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 22:59:18,656 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 22:59:18,656 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 22:59:18,656 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 22:59:18,657 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 22:59:18,657 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 22:59:18,657 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 22:59:18,657 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 22:59:18,657 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 22:59:18,657 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 22:59:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 22:59:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 22:59:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 22:59:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 22:59:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 22:59:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 22:59:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 22:59:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 22:59:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 22:59:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 22:59:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 22:59:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 22:59:18,660 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 22:59:18,660 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 22:59:18,660 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 22:59:18,660 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 22:59:18,660 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 22:59:18,660 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 22:59:18,661 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 22:59:18,661 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 22:59:18,661 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 22:59:18,661 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 22:59:18,661 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 22:59:18,661 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 22:59:18,662 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 22:59:18,662 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 22:59:18,662 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 22:59:18,662 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 22:59:18,662 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 22:59:18,662 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 22:59:18,663 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 22:59:18,663 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 22:59:18,663 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 22:59:18,663 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 22:59:18,663 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 22:59:18,663 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 22:59:18,664 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 22:59:18,664 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 22:59:18,664 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-06 22:59:18,664 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 22:59:18,664 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 22:59:18,664 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 22:59:18,664 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 22:59:18,665 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 22:59:18,665 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 22:59:18,665 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 22:59:18,665 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 22:59:18,665 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 22:59:18,665 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 22:59:18,666 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 22:59:18,666 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 22:59:18,666 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 22:59:18,666 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 22:59:18,666 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 22:59:18,666 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 22:59:18,667 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 22:59:18,667 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 22:59:18,667 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 22:59:18,667 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 22:59:18,667 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 22:59:18,667 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 22:59:18,668 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 22:59:18,668 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 22:59:18,668 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 22:59:18,668 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 22:59:18,668 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 22:59:18,668 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 22:59:18,668 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 22:59:18,669 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 22:59:18,669 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 22:59:18,669 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 22:59:18,669 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 22:59:18,669 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 22:59:18,669 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 22:59:18,670 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 22:59:18,670 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 22:59:18,670 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 22:59:18,670 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 22:59:18,670 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 22:59:18,670 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 22:59:18,670 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 22:59:18,671 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 22:59:18,671 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 22:59:18,671 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 22:59:18,671 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 22:59:18,671 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 22:59:18,671 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 22:59:18,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:59:18,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:59:18,672 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:59:18,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 22:59:18,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 22:59:18,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 22:59:18,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 22:59:18,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 22:59:18,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 22:59:18,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:59:18,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:59:19,380 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:59:19,380 INFO L284 CfgBuilder]: Removed 31 assume(true) statements. [2019-11-06 22:59:19,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:59:19 BoogieIcfgContainer [2019-11-06 22:59:19,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:59:19,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:59:19,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:59:19,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:59:19,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:59:17" (1/3) ... [2019-11-06 22:59:19,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0d74fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:59:19, skipping insertion in model container [2019-11-06 22:59:19,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:18" (2/3) ... [2019-11-06 22:59:19,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0d74fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:59:19, skipping insertion in model container [2019-11-06 22:59:19,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:59:19" (3/3) ... [2019-11-06 22:59:19,391 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-queue-2.i [2019-11-06 22:59:19,402 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:59:19,411 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-11-06 22:59:19,423 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-11-06 22:59:19,459 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:59:19,459 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:59:19,460 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:59:19,461 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:59:19,463 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:59:19,463 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:59:19,463 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:59:19,463 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:59:19,482 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2019-11-06 22:59:19,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-06 22:59:19,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:19,488 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:19,490 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:19,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:19,496 INFO L82 PathProgramCache]: Analyzing trace with hash 786631415, now seen corresponding path program 1 times [2019-11-06 22:59:19,506 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:19,506 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838854620] [2019-11-06 22:59:19,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:19,660 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-06 22:59:19,663 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838854620] [2019-11-06 22:59:19,664 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:19,668 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-06 22:59:19,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189410377] [2019-11-06 22:59:19,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-06 22:59:19,679 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:19,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-06 22:59:19,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-06 22:59:19,698 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 2 states. [2019-11-06 22:59:19,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:19,761 INFO L93 Difference]: Finished difference Result 174 states and 284 transitions. [2019-11-06 22:59:19,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:59:19,763 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-06 22:59:19,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:19,780 INFO L225 Difference]: With dead ends: 174 [2019-11-06 22:59:19,780 INFO L226 Difference]: Without dead ends: 84 [2019-11-06 22:59:19,796 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-06 22:59:19,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-06 22:59:19,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-11-06 22:59:19,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-06 22:59:19,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2019-11-06 22:59:19,866 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 9 [2019-11-06 22:59:19,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:19,867 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2019-11-06 22:59:19,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-06 22:59:19,867 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2019-11-06 22:59:19,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-06 22:59:19,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:19,869 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:19,870 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:19,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:19,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1385985618, now seen corresponding path program 1 times [2019-11-06 22:59:19,871 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:19,871 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147526276] [2019-11-06 22:59:19,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:19,971 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-06 22:59:19,971 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147526276] [2019-11-06 22:59:19,971 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:19,972 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:59:19,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185607601] [2019-11-06 22:59:19,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:59:19,974 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:19,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:59:19,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:59:19,976 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 3 states. [2019-11-06 22:59:20,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:20,021 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-11-06 22:59:20,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:59:20,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-06 22:59:20,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:20,024 INFO L225 Difference]: With dead ends: 84 [2019-11-06 22:59:20,024 INFO L226 Difference]: Without dead ends: 74 [2019-11-06 22:59:20,025 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-06 22:59:20,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-06 22:59:20,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-06 22:59:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-06 22:59:20,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2019-11-06 22:59:20,033 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 10 [2019-11-06 22:59:20,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:20,034 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2019-11-06 22:59:20,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:59:20,034 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2019-11-06 22:59:20,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-06 22:59:20,035 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:20,035 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:20,035 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:20,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:20,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1923530661, now seen corresponding path program 1 times [2019-11-06 22:59:20,036 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:20,036 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418033726] [2019-11-06 22:59:20,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:20,105 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-06 22:59:20,106 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418033726] [2019-11-06 22:59:20,106 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:20,106 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:59:20,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539041354] [2019-11-06 22:59:20,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:59:20,107 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:20,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:59:20,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:59:20,108 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand 3 states. [2019-11-06 22:59:20,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:20,151 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2019-11-06 22:59:20,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:59:20,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-06 22:59:20,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:20,153 INFO L225 Difference]: With dead ends: 74 [2019-11-06 22:59:20,154 INFO L226 Difference]: Without dead ends: 72 [2019-11-06 22:59:20,154 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-06 22:59:20,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-06 22:59:20,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-11-06 22:59:20,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-06 22:59:20,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2019-11-06 22:59:20,167 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 13 [2019-11-06 22:59:20,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:20,167 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2019-11-06 22:59:20,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:59:20,168 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2019-11-06 22:59:20,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 22:59:20,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:20,169 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:20,169 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:20,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:20,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1449483421, now seen corresponding path program 1 times [2019-11-06 22:59:20,170 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:20,170 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109122071] [2019-11-06 22:59:20,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:20,234 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-06 22:59:20,234 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109122071] [2019-11-06 22:59:20,234 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:20,234 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:59:20,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858316794] [2019-11-06 22:59:20,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:59:20,235 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:20,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:59:20,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:59:20,236 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 3 states. [2019-11-06 22:59:20,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:20,277 INFO L93 Difference]: Finished difference Result 157 states and 182 transitions. [2019-11-06 22:59:20,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:59:20,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-06 22:59:20,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:20,279 INFO L225 Difference]: With dead ends: 157 [2019-11-06 22:59:20,280 INFO L226 Difference]: Without dead ends: 91 [2019-11-06 22:59:20,280 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-06 22:59:20,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-06 22:59:20,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 80. [2019-11-06 22:59:20,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-06 22:59:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2019-11-06 22:59:20,289 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 16 [2019-11-06 22:59:20,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:20,289 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2019-11-06 22:59:20,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:59:20,289 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2019-11-06 22:59:20,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 22:59:20,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:20,291 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:20,291 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:20,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:20,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1095322203, now seen corresponding path program 1 times [2019-11-06 22:59:20,292 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:20,292 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615897544] [2019-11-06 22:59:20,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:20,344 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-06 22:59:20,344 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615897544] [2019-11-06 22:59:20,344 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:20,348 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:59:20,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044549047] [2019-11-06 22:59:20,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:59:20,349 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:20,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:59:20,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:59:20,349 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 3 states. [2019-11-06 22:59:20,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:20,363 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2019-11-06 22:59:20,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:59:20,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-06 22:59:20,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:20,367 INFO L225 Difference]: With dead ends: 83 [2019-11-06 22:59:20,367 INFO L226 Difference]: Without dead ends: 81 [2019-11-06 22:59:20,368 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-06 22:59:20,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-06 22:59:20,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-11-06 22:59:20,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-06 22:59:20,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2019-11-06 22:59:20,374 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 21 [2019-11-06 22:59:20,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:20,375 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2019-11-06 22:59:20,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:59:20,375 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2019-11-06 22:59:20,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 22:59:20,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:20,376 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:20,377 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:20,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:20,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1095324125, now seen corresponding path program 1 times [2019-11-06 22:59:20,377 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:20,378 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962882612] [2019-11-06 22:59:20,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:20,436 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-06 22:59:20,437 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962882612] [2019-11-06 22:59:20,437 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:20,437 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:59:20,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458069627] [2019-11-06 22:59:20,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:59:20,442 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:20,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:59:20,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:59:20,443 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 4 states. [2019-11-06 22:59:20,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:20,539 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2019-11-06 22:59:20,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:59:20,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-06 22:59:20,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:20,541 INFO L225 Difference]: With dead ends: 101 [2019-11-06 22:59:20,541 INFO L226 Difference]: Without dead ends: 76 [2019-11-06 22:59:20,541 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-06 22:59:20,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-06 22:59:20,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-11-06 22:59:20,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-06 22:59:20,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2019-11-06 22:59:20,547 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 21 [2019-11-06 22:59:20,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:20,548 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2019-11-06 22:59:20,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:59:20,548 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2019-11-06 22:59:20,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 22:59:20,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:20,549 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, 1, 1] [2019-11-06 22:59:20,549 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:20,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:20,550 INFO L82 PathProgramCache]: Analyzing trace with hash -648846271, now seen corresponding path program 1 times [2019-11-06 22:59:20,550 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:20,550 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136158466] [2019-11-06 22:59:20,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:20,639 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-06 22:59:20,639 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136158466] [2019-11-06 22:59:20,640 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153806156] [2019-11-06 22:59:20,640 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-06 22:59:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:20,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-06 22:59:20,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:59:20,853 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-06 22:59:20,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:20,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:20,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:59:20,867 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-06 22:59:20,895 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:20,895 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-06 22:59:20,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:20,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:20,919 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 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 22:59:20,919 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:20,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:20,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:59:20,931 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2019-11-06 22:59:21,039 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-06 22:59:21,040 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 78 [2019-11-06 22:59:21,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:21,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:21,069 INFO L567 ElimStorePlain]: treesize reduction 32, result has 46.7 percent of original size [2019-11-06 22:59:21,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:21,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2019-11-06 22:59:21,161 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:21,161 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-06 22:59:21,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:21,179 INFO L567 ElimStorePlain]: treesize reduction 12, result has 42.9 percent of original size [2019-11-06 22:59:21,180 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-06 22:59:21,180 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-11-06 22:59:21,191 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-06 22:59:21,191 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:59:21,213 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:21,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:21,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:21,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2019-11-06 22:59:21,277 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 1394 treesize of output 1362 [2019-11-06 22:59:21,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-06 22:59:21,581 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 34 [2019-11-06 22:59:21,582 INFO L567 ElimStorePlain]: treesize reduction 1270, result has 4.1 percent of original size [2019-11-06 22:59:21,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:21,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:21,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:21,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-06 22:59:21,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:43 [2019-11-06 22:59:21,682 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-06 22:59:21,683 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [917114509] [2019-11-06 22:59:21,689 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 24 [2019-11-06 22:59:21,729 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-06 22:59:21,730 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-06 22:59:21,787 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-06 22:59:21,789 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 19 root evaluator evaluations with a maximum evaluation depth of 0. Performed 19 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 30 variables. [2019-11-06 22:59:21,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:21,792 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-06 22:59:21,859 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-11-06 22:59:21,859 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-06 22:59:21,864 INFO L553 sIntCurrentIteration]: We unified 22 AI predicates to 22 [2019-11-06 22:59:21,865 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-06 22:59:21,865 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-06 22:59:21,865 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6, 6, 6] total 10 [2019-11-06 22:59:21,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861957951] [2019-11-06 22:59:21,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-06 22:59:21,866 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:21,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:59:21,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:59:21,867 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 2 states. [2019-11-06 22:59:21,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:21,870 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2019-11-06 22:59:21,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:59:21,870 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2019-11-06 22:59:21,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:21,871 INFO L225 Difference]: With dead ends: 76 [2019-11-06 22:59:21,871 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 22:59:21,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:59:21,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 22:59:21,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 22:59:21,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 22:59:21,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 22:59:21,877 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-11-06 22:59:21,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:21,877 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 22:59:21,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-06 22:59:21,877 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 22:59:21,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 22:59:22,090 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:59:22,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 22:59:22,141 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-06 22:59:22,142 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-11-06 22:59:22,142 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-06 22:59:22,142 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-06 22:59:22,142 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-06 22:59:22,142 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-06 22:59:22,142 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-06 22:59:22,143 INFO L443 ceAbstractionStarter]: For program point L1026-1(line 1026) no Hoare annotation was computed. [2019-11-06 22:59:22,143 INFO L443 ceAbstractionStarter]: For program point L1026-3(line 1026) no Hoare annotation was computed. [2019-11-06 22:59:22,143 INFO L443 ceAbstractionStarter]: For program point L1026-4(lines 1024 1028) no Hoare annotation was computed. [2019-11-06 22:59:22,143 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 982 1055) no Hoare annotation was computed. [2019-11-06 22:59:22,143 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1020) no Hoare annotation was computed. [2019-11-06 22:59:22,144 INFO L443 ceAbstractionStarter]: For program point L1027(line 1027) no Hoare annotation was computed. [2019-11-06 22:59:22,144 INFO L443 ceAbstractionStarter]: For program point L1027-1(line 1027) no Hoare annotation was computed. [2019-11-06 22:59:22,144 INFO L443 ceAbstractionStarter]: For program point L1027-3(line 1027) no Hoare annotation was computed. [2019-11-06 22:59:22,144 INFO L443 ceAbstractionStarter]: For program point L1027-4(lines 1024 1028) no Hoare annotation was computed. [2019-11-06 22:59:22,144 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 1031) no Hoare annotation was computed. [2019-11-06 22:59:22,145 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 1042) no Hoare annotation was computed. [2019-11-06 22:59:22,145 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 982 1055) no Hoare annotation was computed. [2019-11-06 22:59:22,145 INFO L443 ceAbstractionStarter]: For program point L1029(lines 1029 1036) no Hoare annotation was computed. [2019-11-06 22:59:22,145 INFO L443 ceAbstractionStarter]: For program point L1013(line 1013) no Hoare annotation was computed. [2019-11-06 22:59:22,145 INFO L443 ceAbstractionStarter]: For program point L1013-2(line 1013) no Hoare annotation was computed. [2019-11-06 22:59:22,145 INFO L443 ceAbstractionStarter]: For program point L1013-3(lines 992 1015) no Hoare annotation was computed. [2019-11-06 22:59:22,145 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1017) no Hoare annotation was computed. [2019-11-06 22:59:22,146 INFO L443 ceAbstractionStarter]: For program point L997(lines 997 1011) no Hoare annotation was computed. [2019-11-06 22:59:22,146 INFO L443 ceAbstractionStarter]: For program point L1014(line 1014) no Hoare annotation was computed. [2019-11-06 22:59:22,146 INFO L443 ceAbstractionStarter]: For program point L1047-1(lines 983 1055) no Hoare annotation was computed. [2019-11-06 22:59:22,146 INFO L443 ceAbstractionStarter]: For program point L1047-2(lines 1047 1052) no Hoare annotation was computed. [2019-11-06 22:59:22,146 INFO L443 ceAbstractionStarter]: For program point L1014-2(line 1014) no Hoare annotation was computed. [2019-11-06 22:59:22,146 INFO L443 ceAbstractionStarter]: For program point L1014-3(lines 992 1015) no Hoare annotation was computed. [2019-11-06 22:59:22,146 INFO L439 ceAbstractionStarter]: At program point L1014-4(lines 991 1015) the Hoare annotation is: false [2019-11-06 22:59:22,146 INFO L443 ceAbstractionStarter]: For program point L1031-1(line 1031) no Hoare annotation was computed. [2019-11-06 22:59:22,146 INFO L443 ceAbstractionStarter]: For program point L1031-3(line 1031) no Hoare annotation was computed. [2019-11-06 22:59:22,147 INFO L439 ceAbstractionStarter]: At program point L1031-4(line 1031) the Hoare annotation is: false [2019-11-06 22:59:22,147 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1021) no Hoare annotation was computed. [2019-11-06 22:59:22,147 INFO L443 ceAbstractionStarter]: For program point L1032(line 1032) no Hoare annotation was computed. [2019-11-06 22:59:22,147 INFO L443 ceAbstractionStarter]: For program point L1032-1(line 1032) no Hoare annotation was computed. [2019-11-06 22:59:22,148 INFO L443 ceAbstractionStarter]: For program point L1032-3(line 1032) no Hoare annotation was computed. [2019-11-06 22:59:22,148 INFO L443 ceAbstractionStarter]: For program point L1032-4(lines 1030 1036) no Hoare annotation was computed. [2019-11-06 22:59:22,149 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 1032) no Hoare annotation was computed. [2019-11-06 22:59:22,149 INFO L443 ceAbstractionStarter]: For program point L1033(line 1033) no Hoare annotation was computed. [2019-11-06 22:59:22,149 INFO L443 ceAbstractionStarter]: For program point L1033-1(line 1033) no Hoare annotation was computed. [2019-11-06 22:59:22,149 INFO L443 ceAbstractionStarter]: For program point L1033-3(line 1033) no Hoare annotation was computed. [2019-11-06 22:59:22,149 INFO L443 ceAbstractionStarter]: For program point L1033-4(lines 1030 1036) no Hoare annotation was computed. [2019-11-06 22:59:22,149 INFO L443 ceAbstractionStarter]: For program point L1017(line 1017) no Hoare annotation was computed. [2019-11-06 22:59:22,149 INFO L443 ceAbstractionStarter]: For program point L1017-2(line 1017) no Hoare annotation was computed. [2019-11-06 22:59:22,149 INFO L443 ceAbstractionStarter]: For program point L1017-3(lines 983 1055) no Hoare annotation was computed. [2019-11-06 22:59:22,149 INFO L443 ceAbstractionStarter]: For program point L1017-4(lines 983 1055) no Hoare annotation was computed. [2019-11-06 22:59:22,150 INFO L443 ceAbstractionStarter]: For program point L1034(line 1034) no Hoare annotation was computed. [2019-11-06 22:59:22,150 INFO L443 ceAbstractionStarter]: For program point L1034-1(line 1034) no Hoare annotation was computed. [2019-11-06 22:59:22,150 INFO L443 ceAbstractionStarter]: For program point L1034-3(line 1034) no Hoare annotation was computed. [2019-11-06 22:59:22,150 INFO L443 ceAbstractionStarter]: For program point L1034-4(lines 1030 1036) no Hoare annotation was computed. [2019-11-06 22:59:22,150 INFO L443 ceAbstractionStarter]: For program point L1018(lines 983 1055) no Hoare annotation was computed. [2019-11-06 22:59:22,150 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 1034) no Hoare annotation was computed. [2019-11-06 22:59:22,150 INFO L443 ceAbstractionStarter]: For program point L1035(line 1035) no Hoare annotation was computed. [2019-11-06 22:59:22,150 INFO L443 ceAbstractionStarter]: For program point L1002(lines 1002 1011) no Hoare annotation was computed. [2019-11-06 22:59:22,151 INFO L443 ceAbstractionStarter]: For program point L1035-1(line 1035) no Hoare annotation was computed. [2019-11-06 22:59:22,151 INFO L443 ceAbstractionStarter]: For program point L1035-3(line 1035) no Hoare annotation was computed. [2019-11-06 22:59:22,151 INFO L443 ceAbstractionStarter]: For program point L1035-4(lines 1030 1036) no Hoare annotation was computed. [2019-11-06 22:59:22,151 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2019-11-06 22:59:22,151 INFO L443 ceAbstractionStarter]: For program point L1020-1(line 1020) no Hoare annotation was computed. [2019-11-06 22:59:22,151 INFO L443 ceAbstractionStarter]: For program point L1020-3(line 1020) no Hoare annotation was computed. [2019-11-06 22:59:22,152 INFO L439 ceAbstractionStarter]: At program point L1020-4(line 1020) the Hoare annotation is: false [2019-11-06 22:59:22,152 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1025) no Hoare annotation was computed. [2019-11-06 22:59:22,152 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 982 1055) the Hoare annotation is: true [2019-11-06 22:59:22,152 INFO L443 ceAbstractionStarter]: For program point L1021(line 1021) no Hoare annotation was computed. [2019-11-06 22:59:22,152 INFO L443 ceAbstractionStarter]: For program point L1021-1(line 1021) no Hoare annotation was computed. [2019-11-06 22:59:22,152 INFO L443 ceAbstractionStarter]: For program point L1021-3(line 1021) no Hoare annotation was computed. [2019-11-06 22:59:22,153 INFO L443 ceAbstractionStarter]: For program point L1021-4(lines 1019 1022) no Hoare annotation was computed. [2019-11-06 22:59:22,153 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 1033) no Hoare annotation was computed. [2019-11-06 22:59:22,153 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 1027) no Hoare annotation was computed. [2019-11-06 22:59:22,153 INFO L443 ceAbstractionStarter]: For program point L1023(lines 983 1055) no Hoare annotation was computed. [2019-11-06 22:59:22,153 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 1035) no Hoare annotation was computed. [2019-11-06 22:59:22,153 INFO L443 ceAbstractionStarter]: For program point L1007(lines 1007 1011) no Hoare annotation was computed. [2019-11-06 22:59:22,153 INFO L443 ceAbstractionStarter]: For program point L1040-1(line 1040) no Hoare annotation was computed. [2019-11-06 22:59:22,154 INFO L443 ceAbstractionStarter]: For program point L1040-3(lines 1040 1044) no Hoare annotation was computed. [2019-11-06 22:59:22,154 INFO L439 ceAbstractionStarter]: At program point L1040-5(lines 1040 1044) the Hoare annotation is: (and (= main_~status~0 0) (not (= 0 main_~head~0.base))) [2019-11-06 22:59:22,154 INFO L443 ceAbstractionStarter]: For program point L991-1(lines 991 1015) no Hoare annotation was computed. [2019-11-06 22:59:22,154 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1014) no Hoare annotation was computed. [2019-11-06 22:59:22,154 INFO L443 ceAbstractionStarter]: For program point L1025-1(line 1025) no Hoare annotation was computed. [2019-11-06 22:59:22,154 INFO L443 ceAbstractionStarter]: For program point L1025-3(line 1025) no Hoare annotation was computed. [2019-11-06 22:59:22,154 INFO L439 ceAbstractionStarter]: At program point L1025-4(line 1025) the Hoare annotation is: false [2019-11-06 22:59:22,154 INFO L443 ceAbstractionStarter]: For program point L1042-1(line 1042) no Hoare annotation was computed. [2019-11-06 22:59:22,155 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1026) no Hoare annotation was computed. [2019-11-06 22:59:22,155 INFO L443 ceAbstractionStarter]: For program point L1042-3(line 1042) no Hoare annotation was computed. [2019-11-06 22:59:22,155 INFO L443 ceAbstractionStarter]: For program point L1042-4(line 1042) no Hoare annotation was computed. [2019-11-06 22:59:22,155 INFO L443 ceAbstractionStarter]: For program point L1042-6(line 1042) no Hoare annotation was computed. [2019-11-06 22:59:22,155 INFO L439 ceAbstractionStarter]: At program point L1042-7(line 1042) the Hoare annotation is: (and (= main_~status~0 0) (not (= 0 main_~head~0.base))) [2019-11-06 22:59:22,155 INFO L443 ceAbstractionStarter]: For program point L1042-8(line 1042) no Hoare annotation was computed. [2019-11-06 22:59:22,155 INFO L443 ceAbstractionStarter]: For program point L1026(line 1026) no Hoare annotation was computed. [2019-11-06 22:59:22,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:59:22 BoogieIcfgContainer [2019-11-06 22:59:22,171 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 22:59:22,175 INFO L168 Benchmark]: Toolchain (without parser) took 4309.67 ms. Allocated memory was 137.9 MB in the beginning and 250.6 MB in the end (delta: 112.7 MB). Free memory was 101.5 MB in the beginning and 138.9 MB in the end (delta: -37.4 MB). Peak memory consumption was 75.3 MB. Max. memory is 7.1 GB. [2019-11-06 22:59:22,176 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-06 22:59:22,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 633.90 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 101.3 MB in the beginning and 168.2 MB in the end (delta: -66.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-11-06 22:59:22,183 INFO L168 Benchmark]: Boogie Preprocessor took 90.88 ms. Allocated memory is still 202.4 MB. Free memory was 168.2 MB in the beginning and 164.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-11-06 22:59:22,183 INFO L168 Benchmark]: RCFGBuilder took 788.21 ms. Allocated memory is still 202.4 MB. Free memory was 164.7 MB in the beginning and 110.9 MB in the end (delta: 53.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 7.1 GB. [2019-11-06 22:59:22,185 INFO L168 Benchmark]: TraceAbstraction took 2788.20 ms. Allocated memory was 202.4 MB in the beginning and 250.6 MB in the end (delta: 48.2 MB). Free memory was 110.2 MB in the beginning and 138.9 MB in the end (delta: -28.7 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2019-11-06 22:59:22,195 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 633.90 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 101.3 MB in the beginning and 168.2 MB in the end (delta: -66.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 90.88 ms. Allocated memory is still 202.4 MB. Free memory was 168.2 MB in the beginning and 164.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 788.21 ms. Allocated memory is still 202.4 MB. Free memory was 164.7 MB in the beginning and 110.9 MB in the end (delta: 53.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2788.20 ms. Allocated memory was 202.4 MB in the beginning and 250.6 MB in the end (delta: 48.2 MB). Free memory was 110.2 MB in the beginning and 138.9 MB in the end (delta: -28.7 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1032]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1033]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1031]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1021]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1013]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1020]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1014]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1017]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1026]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1042]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1025]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1027]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1034]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1035]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 1031]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1020]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1025]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 991]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1042]: Loop Invariant Derived loop invariant: status == 0 && !(0 == head) - InvariantResult [Line: 1040]: Loop Invariant Derived loop invariant: status == 0 && !(0 == head) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 90 locations, 14 error locations. Result: SAFE, OverallTime: 2.6s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 481 SDtfs, 157 SDslu, 300 SDs, 0 SdLazy, 74 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 12 NumberOfFragments, 24 HoareAnnotationTreeSize, 10 FomulaSimplifications, 18 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 150 ConstructedInterpolants, 15 QuantifiedInterpolants, 18295 SizeOfPredicates, 9 NumberOfNonLiveVariables, 102 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 0/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 104, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9204545454545454, AVG_VARS_REMOVED_DURING_WEAKENING: 0.6818181818181818, AVG_WEAKENED_CONJUNCTS: 0.2727272727272727, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...