/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-token-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:59:26,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:59:26,640 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:59:26,661 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:59:26,661 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:59:26,663 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:59:26,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:59:26,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:59:26,681 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:59:26,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:59:26,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:59:26,687 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:59:26,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:59:26,690 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:59:26,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:59:26,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:59:26,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:59:26,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:59:26,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:59:26,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:59:26,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:59:26,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:59:26,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:59:26,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:59:26,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:59:26,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:59:26,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:59:26,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:59:26,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:59:26,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:59:26,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:59:26,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:59:26,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:59:26,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:59:26,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:59:26,730 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:59:26,730 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:59:26,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:59:26,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:59:26,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:59:26,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:59:26,733 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:26,752 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:59:26,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:59:26,756 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:59:26,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:59:26,756 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:59:26,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:59:26,757 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:59:26,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:59:26,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:59:26,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:59:26,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:59:26,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:59:26,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:59:26,758 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:59:26,759 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:59:26,759 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:59:26,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:59:26,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:59:26,760 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:59:26,760 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:59:26,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:59:26,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:59:26,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:59:26,761 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:59:26,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:59:26,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:59:26,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:59:26,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:59:26,762 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:27,039 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:59:27,058 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:59:27,061 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:59:27,063 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:59:27,063 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:59:27,064 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-token-2.i [2019-11-06 22:59:27,148 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/119cf2c33/e40f895153984f808a99a4e536101739/FLAG94c3bbfe4 [2019-11-06 22:59:27,747 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:59:27,748 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-token-2.i [2019-11-06 22:59:27,767 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/119cf2c33/e40f895153984f808a99a4e536101739/FLAG94c3bbfe4 [2019-11-06 22:59:28,046 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/119cf2c33/e40f895153984f808a99a4e536101739 [2019-11-06 22:59:28,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:59:28,057 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:59:28,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:59:28,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:59:28,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:59:28,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:59:28" (1/1) ... [2019-11-06 22:59:28,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5daf7f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:28, skipping insertion in model container [2019-11-06 22:59:28,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:59:28" (1/1) ... [2019-11-06 22:59:28,073 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:59:28,122 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:59:28,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:59:28,572 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:59:28,621 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:59:28,683 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:59:28,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:28 WrapperNode [2019-11-06 22:59:28,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:59:28,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:59:28,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:59:28,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:59:28,698 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:28" (1/1) ... [2019-11-06 22:59:28,698 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:28" (1/1) ... [2019-11-06 22:59:28,717 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:28" (1/1) ... [2019-11-06 22:59:28,717 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:28" (1/1) ... [2019-11-06 22:59:28,735 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:28" (1/1) ... [2019-11-06 22:59:28,742 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:28" (1/1) ... [2019-11-06 22:59:28,746 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:28" (1/1) ... [2019-11-06 22:59:28,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:59:28,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:59:28,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:59:28,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:59:28,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:28" (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:28,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:59:28,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:59:28,819 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:59:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 22:59:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 22:59:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 22:59:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 22:59:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 22:59:28,820 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 22:59:28,820 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 22:59:28,820 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 22:59:28,820 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 22:59:28,820 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 22:59:28,821 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 22:59:28,821 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 22:59:28,821 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 22:59:28,821 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 22:59:28,821 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 22:59:28,821 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 22:59:28,822 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 22:59:28,822 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 22:59:28,822 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 22:59:28,822 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 22:59:28,822 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 22:59:28,822 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 22:59:28,823 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 22:59:28,823 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 22:59:28,823 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 22:59:28,823 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 22:59:28,823 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 22:59:28,823 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 22:59:28,824 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 22:59:28,824 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 22:59:28,824 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 22:59:28,824 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 22:59:28,824 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 22:59:28,824 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 22:59:28,825 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 22:59:28,825 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 22:59:28,825 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 22:59:28,825 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 22:59:28,825 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 22:59:28,825 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 22:59:28,825 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 22:59:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 22:59:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 22:59:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 22:59:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 22:59:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 22:59:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 22:59:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 22:59:28,827 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 22:59:28,827 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 22:59:28,827 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 22:59:28,827 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 22:59:28,827 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 22:59:28,827 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 22:59:28,828 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-06 22:59:28,828 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 22:59:28,828 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 22:59:28,828 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 22:59:28,828 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 22:59:28,828 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 22:59:28,829 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 22:59:28,829 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 22:59:28,829 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 22:59:28,829 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 22:59:28,829 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 22:59:28,829 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 22:59:28,830 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 22:59:28,830 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 22:59:28,830 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 22:59:28,830 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 22:59:28,830 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 22:59:28,830 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 22:59:28,830 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 22:59:28,831 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 22:59:28,831 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 22:59:28,831 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 22:59:28,831 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 22:59:28,831 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 22:59:28,831 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 22:59:28,832 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 22:59:28,832 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 22:59:28,832 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 22:59:28,832 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 22:59:28,832 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 22:59:28,832 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 22:59:28,833 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 22:59:28,833 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 22:59:28,833 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 22:59:28,833 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 22:59:28,833 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 22:59:28,833 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 22:59:28,833 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 22:59:28,834 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 22:59:28,834 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 22:59:28,834 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 22:59:28,834 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 22:59:28,834 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 22:59:28,834 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 22:59:28,834 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 22:59:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 22:59:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 22:59:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 22:59:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 22:59:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:59:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:59:28,835 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:59:28,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 22:59:28,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 22:59:28,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 22:59:28,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 22:59:28,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 22:59:28,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 22:59:28,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:59:28,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:59:29,421 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:59:29,421 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-11-06 22:59:29,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:59:29 BoogieIcfgContainer [2019-11-06 22:59:29,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:59:29,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:59:29,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:59:29,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:59:29,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:59:28" (1/3) ... [2019-11-06 22:59:29,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607a1cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:59:29, skipping insertion in model container [2019-11-06 22:59:29,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:28" (2/3) ... [2019-11-06 22:59:29,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607a1cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:59:29, skipping insertion in model container [2019-11-06 22:59:29,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:59:29" (3/3) ... [2019-11-06 22:59:29,433 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-token-2.i [2019-11-06 22:59:29,442 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:59:29,450 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-06 22:59:29,461 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-06 22:59:29,482 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:59:29,482 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:59:29,483 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:59:29,483 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:59:29,484 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:59:29,484 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:59:29,484 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:59:29,484 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:59:29,504 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-11-06 22:59:29,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-06 22:59:29,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:29,512 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:29,514 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:29,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:29,521 INFO L82 PathProgramCache]: Analyzing trace with hash 68430596, now seen corresponding path program 1 times [2019-11-06 22:59:29,531 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:29,531 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631677874] [2019-11-06 22:59:29,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:29,670 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:29,671 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631677874] [2019-11-06 22:59:29,671 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:29,672 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-06 22:59:29,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622186362] [2019-11-06 22:59:29,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-06 22:59:29,679 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:29,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-06 22:59:29,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-06 22:59:29,694 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2019-11-06 22:59:29,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:29,720 INFO L93 Difference]: Finished difference Result 92 states and 138 transitions. [2019-11-06 22:59:29,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:59:29,721 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-06 22:59:29,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:29,730 INFO L225 Difference]: With dead ends: 92 [2019-11-06 22:59:29,730 INFO L226 Difference]: Without dead ends: 43 [2019-11-06 22:59:29,733 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:29,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-06 22:59:29,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-06 22:59:29,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-06 22:59:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-11-06 22:59:29,769 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 10 [2019-11-06 22:59:29,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:29,770 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-11-06 22:59:29,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-06 22:59:29,770 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-11-06 22:59:29,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-06 22:59:29,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:29,771 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:29,772 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:29,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:29,772 INFO L82 PathProgramCache]: Analyzing trace with hash 67663975, now seen corresponding path program 1 times [2019-11-06 22:59:29,772 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:29,773 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201786177] [2019-11-06 22:59:29,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:29,866 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:29,866 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201786177] [2019-11-06 22:59:29,866 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:29,867 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:59:29,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46749309] [2019-11-06 22:59:29,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:59:29,868 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:29,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:59:29,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:59:29,869 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 3 states. [2019-11-06 22:59:29,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:29,934 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-11-06 22:59:29,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:59:29,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-06 22:59:29,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:29,936 INFO L225 Difference]: With dead ends: 43 [2019-11-06 22:59:29,936 INFO L226 Difference]: Without dead ends: 41 [2019-11-06 22:59:29,937 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:29,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-06 22:59:29,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-06 22:59:29,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-06 22:59:29,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-11-06 22:59:29,958 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 10 [2019-11-06 22:59:29,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:29,959 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-11-06 22:59:29,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:59:29,959 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-11-06 22:59:29,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-06 22:59:29,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:29,960 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:29,960 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:29,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:29,961 INFO L82 PathProgramCache]: Analyzing trace with hash 2097539711, now seen corresponding path program 1 times [2019-11-06 22:59:29,961 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:29,961 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853479091] [2019-11-06 22:59:29,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:30,039 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:30,040 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853479091] [2019-11-06 22:59:30,040 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:30,040 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:59:30,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444950840] [2019-11-06 22:59:30,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:59:30,043 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:30,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:59:30,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:59:30,043 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 4 states. [2019-11-06 22:59:30,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:30,130 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-11-06 22:59:30,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:59:30,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-06 22:59:30,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:30,133 INFO L225 Difference]: With dead ends: 67 [2019-11-06 22:59:30,133 INFO L226 Difference]: Without dead ends: 65 [2019-11-06 22:59:30,134 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:30,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-06 22:59:30,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2019-11-06 22:59:30,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-06 22:59:30,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-11-06 22:59:30,141 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 11 [2019-11-06 22:59:30,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:30,142 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-11-06 22:59:30,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:59:30,142 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-11-06 22:59:30,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 22:59:30,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:30,143 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:30,143 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:30,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:30,144 INFO L82 PathProgramCache]: Analyzing trace with hash -409997773, now seen corresponding path program 1 times [2019-11-06 22:59:30,144 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:30,144 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360727597] [2019-11-06 22:59:30,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:30,223 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:30,224 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360727597] [2019-11-06 22:59:30,224 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:30,224 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:59:30,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049227719] [2019-11-06 22:59:30,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:59:30,225 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:30,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:59:30,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:59:30,226 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 5 states. [2019-11-06 22:59:30,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:30,347 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-11-06 22:59:30,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:59:30,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-06 22:59:30,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:30,348 INFO L225 Difference]: With dead ends: 39 [2019-11-06 22:59:30,348 INFO L226 Difference]: Without dead ends: 37 [2019-11-06 22:59:30,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:59:30,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-06 22:59:30,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-06 22:59:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-06 22:59:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-11-06 22:59:30,355 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 16 [2019-11-06 22:59:30,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:30,355 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-11-06 22:59:30,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:59:30,356 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-11-06 22:59:30,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 22:59:30,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:30,357 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:30,357 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:30,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:30,357 INFO L82 PathProgramCache]: Analyzing trace with hash -409960037, now seen corresponding path program 1 times [2019-11-06 22:59:30,358 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:30,358 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577325137] [2019-11-06 22:59:30,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:30,594 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:30,595 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577325137] [2019-11-06 22:59:30,595 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:30,595 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:59:30,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957316030] [2019-11-06 22:59:30,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:59:30,596 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:30,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:59:30,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:59:30,597 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 5 states. [2019-11-06 22:59:30,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:30,807 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2019-11-06 22:59:30,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:59:30,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-06 22:59:30,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:30,810 INFO L225 Difference]: With dead ends: 72 [2019-11-06 22:59:30,810 INFO L226 Difference]: Without dead ends: 48 [2019-11-06 22:59:30,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:59:30,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-06 22:59:30,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2019-11-06 22:59:30,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-06 22:59:30,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-11-06 22:59:30,831 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 16 [2019-11-06 22:59:30,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:30,831 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-11-06 22:59:30,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:59:30,831 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-11-06 22:59:30,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 22:59:30,832 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:30,833 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] [2019-11-06 22:59:30,835 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:30,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:30,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1407314597, now seen corresponding path program 1 times [2019-11-06 22:59:30,837 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:30,838 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614375061] [2019-11-06 22:59:30,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:30,959 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:30,960 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614375061] [2019-11-06 22:59:30,960 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:30,960 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 22:59:30,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237520811] [2019-11-06 22:59:30,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:59:30,961 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:30,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:59:30,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:59:30,964 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 6 states. [2019-11-06 22:59:31,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:31,107 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-11-06 22:59:31,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:59:31,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-06 22:59:31,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:31,110 INFO L225 Difference]: With dead ends: 54 [2019-11-06 22:59:31,110 INFO L226 Difference]: Without dead ends: 52 [2019-11-06 22:59:31,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:59:31,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-06 22:59:31,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2019-11-06 22:59:31,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-06 22:59:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-11-06 22:59:31,126 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 20 [2019-11-06 22:59:31,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:31,126 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-11-06 22:59:31,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:59:31,126 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-11-06 22:59:31,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 22:59:31,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:31,129 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:31,129 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:31,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:31,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1742673852, now seen corresponding path program 1 times [2019-11-06 22:59:31,130 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:31,131 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099772940] [2019-11-06 22:59:31,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:31,349 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:31,350 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099772940] [2019-11-06 22:59:31,351 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663335743] [2019-11-06 22:59:31,351 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:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:31,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-06 22:59:31,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:59:31,563 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:31,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:31,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:31,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 22:59:31,584 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:31,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:31,598 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:31,599 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-11-06 22:59:31,667 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:31,667 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 22:59:31,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:31,729 INFO L567 ElimStorePlain]: treesize reduction 14, result has 79.7 percent of original size [2019-11-06 22:59:31,737 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:31,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:31,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:31,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2019-11-06 22:59:31,766 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:31,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:31,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:59:31,780 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:57, output treesize:36 [2019-11-06 22:59:31,835 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:31,836 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-06 22:59:31,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:31,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:31,861 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_24|], 10=[|v_#memory_int_26|]} [2019-11-06 22:59:31,867 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:31,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:31,910 INFO L341 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-11-06 22:59:31,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 39 [2019-11-06 22:59:31,911 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:31,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:31,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:31,929 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:72, output treesize:41 [2019-11-06 22:59:31,981 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-11-06 22:59:31,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:31,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:31,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:59:31,990 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-11-06 22:59:31,994 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:31,994 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:59:32,005 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:32,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:32,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:32,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:52 [2019-11-06 22:59:32,054 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:32,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:32,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:32,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:93 [2019-11-06 22:59:32,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:32,122 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:59:32,122 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 11 [2019-11-06 22:59:32,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508121592] [2019-11-06 22:59:32,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:59:32,123 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:32,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:59:32,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-06 22:59:32,124 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 6 states. [2019-11-06 22:59:32,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:32,702 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2019-11-06 22:59:32,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:59:32,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-06 22:59:32,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:32,705 INFO L225 Difference]: With dead ends: 62 [2019-11-06 22:59:32,705 INFO L226 Difference]: Without dead ends: 60 [2019-11-06 22:59:32,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-11-06 22:59:32,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-06 22:59:32,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2019-11-06 22:59:32,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-06 22:59:32,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-11-06 22:59:32,714 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 20 [2019-11-06 22:59:32,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:32,714 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-11-06 22:59:32,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:59:32,714 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-11-06 22:59:32,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 22:59:32,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:32,715 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, 1] [2019-11-06 22:59:32,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:59:32,920 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:32,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:32,920 INFO L82 PathProgramCache]: Analyzing trace with hash 995688324, now seen corresponding path program 1 times [2019-11-06 22:59:32,921 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:32,921 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367159946] [2019-11-06 22:59:32,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:33,097 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:33,097 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367159946] [2019-11-06 22:59:33,097 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938418811] [2019-11-06 22:59:33,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:59:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:33,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-06 22:59:33,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:59:33,214 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:33,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:33,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:33,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 22:59:33,231 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:33,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:33,243 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:33,243 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-11-06 22:59:33,295 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:33,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 22:59:33,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:33,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:33,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:33,330 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-06 22:59:33,330 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:33,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:33,348 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-06 22:59:33,349 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:33,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:33,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:59:33,360 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:26 [2019-11-06 22:59:33,385 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_32|], 10=[|v_#memory_int_34|]} [2019-11-06 22:59:33,388 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:33,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:33,515 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-11-06 22:59:33,516 INFO L341 Elim1Store]: treesize reduction 30, result has 75.8 percent of original size [2019-11-06 22:59:33,516 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 107 [2019-11-06 22:59:33,517 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:33,597 INFO L567 ElimStorePlain]: treesize reduction 48, result has 55.6 percent of original size [2019-11-06 22:59:33,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:33,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:33,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:33,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:33,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:33,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:33,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:33,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:33,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:33,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:33,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:33,611 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:55, output treesize:90 [2019-11-06 22:59:33,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:33,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:33,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:33,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:33,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:33,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:33,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:33,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:33,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:33,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:33,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:33,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:33,798 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:33,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 39 [2019-11-06 22:59:33,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:33,809 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 14 [2019-11-06 22:59:33,812 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:33,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-06 22:59:33,819 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:33,871 INFO L567 ElimStorePlain]: treesize reduction 4, result has 90.7 percent of original size [2019-11-06 22:59:33,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-06 22:59:33,875 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:90, output treesize:7 [2019-11-06 22:59:33,899 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:33,900 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:59:33,939 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:33,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:33,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:33,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:44 [2019-11-06 22:59:34,025 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:34,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:34,043 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:34,043 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:83 [2019-11-06 22:59:34,127 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:34,127 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [357232690] [2019-11-06 22:59:34,137 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 25 [2019-11-06 22:59:34,174 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-06 22:59:34,174 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-06 22:59:34,230 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-06 22:59:34,232 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 36 variables. [2019-11-06 22:59:34,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:34,238 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-06 22:59:34,273 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-11-06 22:59:34,273 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-06 22:59:34,274 INFO L553 sIntCurrentIteration]: We unified 23 AI predicates to 23 [2019-11-06 22:59:34,275 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-06 22:59:34,275 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-06 22:59:34,275 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6, 6, 6] total 14 [2019-11-06 22:59:34,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873321882] [2019-11-06 22:59:34,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-06 22:59:34,276 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:34,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:59:34,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-11-06 22:59:34,277 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 2 states. [2019-11-06 22:59:34,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:34,279 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-11-06 22:59:34,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:59:34,279 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2019-11-06 22:59:34,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:34,280 INFO L225 Difference]: With dead ends: 54 [2019-11-06 22:59:34,280 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 22:59:34,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-11-06 22:59:34,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 22:59:34,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 22:59:34,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 22:59:34,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 22:59:34,281 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-11-06 22:59:34,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:34,282 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 22:59:34,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-06 22:59:34,282 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 22:59:34,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 22:59:34,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:59:34,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 22:59:34,524 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-06 22:59:34,524 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-11-06 22:59:34,524 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-06 22:59:34,525 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-06 22:59:34,526 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-06 22:59:34,526 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-06 22:59:34,526 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-06 22:59:34,526 INFO L443 ceAbstractionStarter]: For program point L1026-1(lines 1026 1031) no Hoare annotation was computed. [2019-11-06 22:59:34,526 INFO L439 ceAbstractionStarter]: At program point L1026-3(lines 1026 1031) the Hoare annotation is: false [2019-11-06 22:59:34,526 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 989 1037) no Hoare annotation was computed. [2019-11-06 22:59:34,527 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2019-11-06 22:59:34,527 INFO L443 ceAbstractionStarter]: For program point L1020(line 1020) no Hoare annotation was computed. [2019-11-06 22:59:34,527 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1005) no Hoare annotation was computed. [2019-11-06 22:59:34,527 INFO L443 ceAbstractionStarter]: For program point L1020-1(line 1020) no Hoare annotation was computed. [2019-11-06 22:59:34,527 INFO L443 ceAbstractionStarter]: For program point L1020-3(line 1020) no Hoare annotation was computed. [2019-11-06 22:59:34,527 INFO L443 ceAbstractionStarter]: For program point L1020-4(lines 990 1037) no Hoare annotation was computed. [2019-11-06 22:59:34,527 INFO L443 ceAbstractionStarter]: For program point L1020-5(line 1020) no Hoare annotation was computed. [2019-11-06 22:59:34,527 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 989 1037) no Hoare annotation was computed. [2019-11-06 22:59:34,528 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1020) no Hoare annotation was computed. [2019-11-06 22:59:34,528 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 989 1037) the Hoare annotation is: true [2019-11-06 22:59:34,528 INFO L443 ceAbstractionStarter]: For program point L1013-1(line 1013) no Hoare annotation was computed. [2019-11-06 22:59:34,528 INFO L443 ceAbstractionStarter]: For program point L1013-3(line 1013) no Hoare annotation was computed. [2019-11-06 22:59:34,528 INFO L439 ceAbstractionStarter]: At program point L1013-4(line 1013) the Hoare annotation is: false [2019-11-06 22:59:34,528 INFO L443 ceAbstractionStarter]: For program point L1005-1(line 1005) no Hoare annotation was computed. [2019-11-06 22:59:34,528 INFO L443 ceAbstractionStarter]: For program point L1005-3(line 1005) no Hoare annotation was computed. [2019-11-06 22:59:34,528 INFO L439 ceAbstractionStarter]: At program point L1005-4(line 1005) the Hoare annotation is: false [2019-11-06 22:59:34,529 INFO L439 ceAbstractionStarter]: At program point L1005-5(lines 999 1006) the Hoare annotation is: false [2019-11-06 22:59:34,529 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1017) no Hoare annotation was computed. [2019-11-06 22:59:34,529 INFO L443 ceAbstractionStarter]: For program point L1022-1(line 1022) no Hoare annotation was computed. [2019-11-06 22:59:34,529 INFO L443 ceAbstractionStarter]: For program point L1022-2(line 1022) no Hoare annotation was computed. [2019-11-06 22:59:34,529 INFO L443 ceAbstractionStarter]: For program point L1022-4(line 1022) no Hoare annotation was computed. [2019-11-06 22:59:34,529 INFO L439 ceAbstractionStarter]: At program point L1022-5(line 1022) the Hoare annotation is: false [2019-11-06 22:59:34,529 INFO L443 ceAbstractionStarter]: For program point L1022-6(line 1022) no Hoare annotation was computed. [2019-11-06 22:59:34,529 INFO L443 ceAbstractionStarter]: For program point L1015(lines 1015 1019) no Hoare annotation was computed. [2019-11-06 22:59:34,530 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1032) no Hoare annotation was computed. [2019-11-06 22:59:34,530 INFO L443 ceAbstractionStarter]: For program point L1015-2(lines 990 1037) no Hoare annotation was computed. [2019-11-06 22:59:34,530 INFO L443 ceAbstractionStarter]: For program point L1032(line 1032) no Hoare annotation was computed. [2019-11-06 22:59:34,531 INFO L443 ceAbstractionStarter]: For program point L1032-1(line 1032) no Hoare annotation was computed. [2019-11-06 22:59:34,531 INFO L443 ceAbstractionStarter]: For program point L999-1(lines 999 1006) no Hoare annotation was computed. [2019-11-06 22:59:34,531 INFO L443 ceAbstractionStarter]: For program point L1032-3(line 1032) no Hoare annotation was computed. [2019-11-06 22:59:34,531 INFO L443 ceAbstractionStarter]: For program point L999-3(lines 999 1006) no Hoare annotation was computed. [2019-11-06 22:59:34,531 INFO L443 ceAbstractionStarter]: For program point L1032-4(lines 990 1037) no Hoare annotation was computed. [2019-11-06 22:59:34,532 INFO L443 ceAbstractionStarter]: For program point L1032-5(line 1032) no Hoare annotation was computed. [2019-11-06 22:59:34,532 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1022) no Hoare annotation was computed. [2019-11-06 22:59:34,532 INFO L443 ceAbstractionStarter]: For program point L1017-1(line 1017) no Hoare annotation was computed. [2019-11-06 22:59:34,532 INFO L443 ceAbstractionStarter]: For program point L1017-2(line 1017) no Hoare annotation was computed. [2019-11-06 22:59:34,533 INFO L443 ceAbstractionStarter]: For program point L1017-4(line 1017) no Hoare annotation was computed. [2019-11-06 22:59:34,533 INFO L439 ceAbstractionStarter]: At program point L1017-5(line 1017) the Hoare annotation is: false [2019-11-06 22:59:34,533 INFO L443 ceAbstractionStarter]: For program point L1017-6(line 1017) no Hoare annotation was computed. [2019-11-06 22:59:34,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:59:34 BoogieIcfgContainer [2019-11-06 22:59:34,543 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 22:59:34,545 INFO L168 Benchmark]: Toolchain (without parser) took 6488.15 ms. Allocated memory was 146.3 MB in the beginning and 282.1 MB in the end (delta: 135.8 MB). Free memory was 101.1 MB in the beginning and 216.5 MB in the end (delta: -115.5 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-11-06 22:59:34,556 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 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:34,557 INFO L168 Benchmark]: CACSL2BoogieTranslator took 627.28 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 100.8 MB in the beginning and 169.8 MB in the end (delta: -68.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-11-06 22:59:34,558 INFO L168 Benchmark]: Boogie Preprocessor took 66.67 ms. Allocated memory is still 203.4 MB. Free memory was 169.8 MB in the beginning and 167.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-11-06 22:59:34,558 INFO L168 Benchmark]: RCFGBuilder took 672.77 ms. Allocated memory is still 203.4 MB. Free memory was 167.2 MB in the beginning and 122.0 MB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 7.1 GB. [2019-11-06 22:59:34,563 INFO L168 Benchmark]: TraceAbstraction took 5116.94 ms. Allocated memory was 203.4 MB in the beginning and 282.1 MB in the end (delta: 78.6 MB). Free memory was 122.0 MB in the beginning and 216.5 MB in the end (delta: -94.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-11-06 22:59:34,564 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.24 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 627.28 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 100.8 MB in the beginning and 169.8 MB in the end (delta: -68.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.67 ms. Allocated memory is still 203.4 MB. Free memory was 169.8 MB in the beginning and 167.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 672.77 ms. Allocated memory is still 203.4 MB. Free memory was 167.2 MB in the beginning and 122.0 MB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5116.94 ms. Allocated memory was 203.4 MB in the beginning and 282.1 MB in the end (delta: 78.6 MB). Free memory was 122.0 MB in the beginning and 216.5 MB in the end (delta: -94.6 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1013]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1032]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1022]: 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: 1017]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1005]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 1026]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1005]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1022]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1013]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 49 locations, 6 error locations. Result: SAFE, OverallTime: 5.0s, OverallIterations: 8, TraceHistogramMax: 2, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 260 SDtfs, 120 SDslu, 386 SDs, 0 SdLazy, 257 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 87 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=7, 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, 8 MinimizatonAttempts, 38 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 10 NumberOfFragments, 10 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 203 ConstructedInterpolants, 22 QuantifiedInterpolants, 52611 SizeOfPredicates, 22 NumberOfNonLiveVariables, 216 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 2/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 103, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9347826086956522, AVG_VARS_REMOVED_DURING_WEAKENING: 0.9130434782608695, AVG_WEAKENED_CONJUNCTS: 0.2608695652173913, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...