java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/forester-heap/sll-queue-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 20:12:13,889 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 20:12:13,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 20:12:13,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 20:12:13,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 20:12:13,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 20:12:13,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 20:12:13,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 20:12:13,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 20:12:13,911 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 20:12:13,912 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 20:12:13,913 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 20:12:13,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 20:12:13,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 20:12:13,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 20:12:13,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 20:12:13,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 20:12:13,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 20:12:13,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 20:12:13,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 20:12:13,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 20:12:13,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 20:12:13,926 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 20:12:13,926 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 20:12:13,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 20:12:13,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 20:12:13,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 20:12:13,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 20:12:13,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 20:12:13,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 20:12:13,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 20:12:13,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 20:12:13,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 20:12:13,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 20:12:13,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 20:12:13,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 20:12:13,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 20:12:13,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 20:12:13,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 20:12:13,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 20:12:13,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 20:12:13,939 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 20:12:13,953 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 20:12:13,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 20:12:13,955 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 20:12:13,955 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 20:12:13,955 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 20:12:13,955 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 20:12:13,956 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 20:12:13,956 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 20:12:13,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 20:12:13,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 20:12:13,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 20:12:13,957 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 20:12:13,957 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 20:12:13,957 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 20:12:13,957 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 20:12:13,957 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 20:12:13,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 20:12:13,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 20:12:13,958 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 20:12:13,958 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 20:12:13,958 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 20:12:13,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:12:13,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 20:12:13,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 20:12:13,959 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 20:12:13,959 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 20:12:13,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 20:12:13,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 20:12:13,960 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-10-13 20:12:14,252 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 20:12:14,267 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 20:12:14,270 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 20:12:14,272 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 20:12:14,272 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 20:12:14,273 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-queue-2.i [2019-10-13 20:12:14,336 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf75c6ea3/8f309359ee1045709aaec0deee736e45/FLAG457073860 [2019-10-13 20:12:14,881 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 20:12:14,881 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-queue-2.i [2019-10-13 20:12:14,912 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf75c6ea3/8f309359ee1045709aaec0deee736e45/FLAG457073860 [2019-10-13 20:12:15,182 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf75c6ea3/8f309359ee1045709aaec0deee736e45 [2019-10-13 20:12:15,191 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 20:12:15,192 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 20:12:15,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 20:12:15,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 20:12:15,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 20:12:15,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:12:15" (1/1) ... [2019-10-13 20:12:15,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b94beeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:15, skipping insertion in model container [2019-10-13 20:12:15,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:12:15" (1/1) ... [2019-10-13 20:12:15,209 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 20:12:15,257 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 20:12:15,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:12:15,732 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 20:12:15,811 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:12:15,860 INFO L192 MainTranslator]: Completed translation [2019-10-13 20:12:15,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:15 WrapperNode [2019-10-13 20:12:15,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 20:12:15,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 20:12:15,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 20:12:15,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 20:12:15,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:15" (1/1) ... [2019-10-13 20:12:15,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:15" (1/1) ... [2019-10-13 20:12:15,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:15" (1/1) ... [2019-10-13 20:12:15,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:15" (1/1) ... [2019-10-13 20:12:15,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:15" (1/1) ... [2019-10-13 20:12:15,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:15" (1/1) ... [2019-10-13 20:12:15,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:15" (1/1) ... [2019-10-13 20:12:15,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 20:12:15,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 20:12:15,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 20:12:15,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 20:12:15,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:12:15,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 20:12:15,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 20:12:15,995 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 20:12:15,995 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 20:12:15,995 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 20:12:15,997 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 20:12:15,997 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 20:12:15,998 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 20:12:15,999 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 20:12:16,000 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 20:12:16,000 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 20:12:16,001 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 20:12:16,001 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 20:12:16,002 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 20:12:16,002 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 20:12:16,002 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 20:12:16,004 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 20:12:16,005 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 20:12:16,005 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 20:12:16,005 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 20:12:16,005 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 20:12:16,006 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 20:12:16,006 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 20:12:16,006 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 20:12:16,006 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 20:12:16,007 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 20:12:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 20:12:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 20:12:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 20:12:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 20:12:16,009 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 20:12:16,009 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 20:12:16,009 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 20:12:16,009 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 20:12:16,009 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 20:12:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 20:12:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 20:12:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 20:12:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 20:12:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 20:12:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 20:12:16,011 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 20:12:16,011 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 20:12:16,011 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 20:12:16,011 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 20:12:16,011 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 20:12:16,011 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 20:12:16,011 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 20:12:16,012 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 20:12:16,012 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 20:12:16,012 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 20:12:16,012 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 20:12:16,012 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 20:12:16,012 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 20:12:16,012 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 20:12:16,013 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 20:12:16,013 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 20:12:16,013 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 20:12:16,013 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 20:12:16,013 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 20:12:16,014 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 20:12:16,014 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 20:12:16,014 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 20:12:16,014 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 20:12:16,015 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 20:12:16,015 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 20:12:16,015 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 20:12:16,015 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 20:12:16,016 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 20:12:16,016 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 20:12:16,016 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 20:12:16,016 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 20:12:16,017 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 20:12:16,017 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 20:12:16,018 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 20:12:16,018 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 20:12:16,018 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 20:12:16,018 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 20:12:16,018 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 20:12:16,019 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 20:12:16,019 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 20:12:16,019 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 20:12:16,019 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 20:12:16,019 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 20:12:16,020 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 20:12:16,021 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 20:12:16,021 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 20:12:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 20:12:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 20:12:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 20:12:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 20:12:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 20:12:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 20:12:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 20:12:16,023 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 20:12:16,023 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 20:12:16,023 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 20:12:16,023 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 20:12:16,023 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 20:12:16,023 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 20:12:16,023 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 20:12:16,024 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 20:12:16,024 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 20:12:16,024 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 20:12:16,024 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 20:12:16,024 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 20:12:16,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 20:12:16,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 20:12:16,025 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 20:12:16,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 20:12:16,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 20:12:16,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 20:12:16,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 20:12:16,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 20:12:16,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 20:12:16,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 20:12:16,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 20:12:16,736 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 20:12:16,736 INFO L284 CfgBuilder]: Removed 31 assume(true) statements. [2019-10-13 20:12:16,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:12:16 BoogieIcfgContainer [2019-10-13 20:12:16,738 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 20:12:16,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 20:12:16,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 20:12:16,743 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 20:12:16,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:12:15" (1/3) ... [2019-10-13 20:12:16,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@367e9c90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:12:16, skipping insertion in model container [2019-10-13 20:12:16,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:15" (2/3) ... [2019-10-13 20:12:16,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@367e9c90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:12:16, skipping insertion in model container [2019-10-13 20:12:16,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:12:16" (3/3) ... [2019-10-13 20:12:16,746 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-queue-2.i [2019-10-13 20:12:16,756 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 20:12:16,765 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-10-13 20:12:16,776 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-10-13 20:12:16,807 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 20:12:16,808 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 20:12:16,808 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 20:12:16,809 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 20:12:16,812 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 20:12:16,813 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 20:12:16,813 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 20:12:16,814 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 20:12:16,838 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2019-10-13 20:12:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-13 20:12:16,844 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:16,845 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:16,847 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:16,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:16,853 INFO L82 PathProgramCache]: Analyzing trace with hash 786631415, now seen corresponding path program 1 times [2019-10-13 20:12:16,862 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:16,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760256594] [2019-10-13 20:12:16,863 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:16,863 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:16,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:17,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760256594] [2019-10-13 20:12:17,016 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:17,016 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 20:12:17,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375591649] [2019-10-13 20:12:17,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 20:12:17,028 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:17,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 20:12:17,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:12:17,054 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 2 states. [2019-10-13 20:12:17,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:17,107 INFO L93 Difference]: Finished difference Result 174 states and 284 transitions. [2019-10-13 20:12:17,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 20:12:17,109 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-10-13 20:12:17,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:17,129 INFO L225 Difference]: With dead ends: 174 [2019-10-13 20:12:17,129 INFO L226 Difference]: Without dead ends: 84 [2019-10-13 20:12:17,136 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:12:17,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-13 20:12:17,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-10-13 20:12:17,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-13 20:12:17,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2019-10-13 20:12:17,218 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 9 [2019-10-13 20:12:17,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:17,219 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2019-10-13 20:12:17,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 20:12:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2019-10-13 20:12:17,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-13 20:12:17,222 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:17,222 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:17,223 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:17,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:17,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1385985618, now seen corresponding path program 1 times [2019-10-13 20:12:17,225 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:17,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721979928] [2019-10-13 20:12:17,225 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:17,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:17,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:17,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:17,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721979928] [2019-10-13 20:12:17,375 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:17,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 20:12:17,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199266989] [2019-10-13 20:12:17,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 20:12:17,377 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:17,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 20:12:17,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:12:17,378 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 3 states. [2019-10-13 20:12:17,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:17,418 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-10-13 20:12:17,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:12:17,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-13 20:12:17,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:17,420 INFO L225 Difference]: With dead ends: 84 [2019-10-13 20:12:17,420 INFO L226 Difference]: Without dead ends: 74 [2019-10-13 20:12:17,422 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:12:17,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-13 20:12:17,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-10-13 20:12:17,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-13 20:12:17,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2019-10-13 20:12:17,430 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 10 [2019-10-13 20:12:17,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:17,431 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2019-10-13 20:12:17,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 20:12:17,431 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2019-10-13 20:12:17,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 20:12:17,432 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:17,432 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:17,433 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:17,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:17,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1923530661, now seen corresponding path program 1 times [2019-10-13 20:12:17,435 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:17,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892040820] [2019-10-13 20:12:17,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:17,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:17,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:17,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892040820] [2019-10-13 20:12:17,536 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:17,536 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 20:12:17,536 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135489148] [2019-10-13 20:12:17,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 20:12:17,537 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:17,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 20:12:17,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:12:17,539 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand 3 states. [2019-10-13 20:12:17,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:17,575 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2019-10-13 20:12:17,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:12:17,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 20:12:17,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:17,577 INFO L225 Difference]: With dead ends: 74 [2019-10-13 20:12:17,577 INFO L226 Difference]: Without dead ends: 72 [2019-10-13 20:12:17,578 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:12:17,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-13 20:12:17,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-10-13 20:12:17,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-13 20:12:17,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2019-10-13 20:12:17,585 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 13 [2019-10-13 20:12:17,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:17,586 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2019-10-13 20:12:17,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 20:12:17,586 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2019-10-13 20:12:17,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 20:12:17,587 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:17,587 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:17,588 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:17,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:17,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1449483421, now seen corresponding path program 1 times [2019-10-13 20:12:17,588 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:17,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285681147] [2019-10-13 20:12:17,589 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:17,589 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:17,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:17,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:17,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285681147] [2019-10-13 20:12:17,631 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:17,632 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 20:12:17,632 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137473472] [2019-10-13 20:12:17,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 20:12:17,633 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:17,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 20:12:17,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:12:17,633 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 3 states. [2019-10-13 20:12:17,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:17,705 INFO L93 Difference]: Finished difference Result 157 states and 182 transitions. [2019-10-13 20:12:17,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:12:17,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-13 20:12:17,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:17,708 INFO L225 Difference]: With dead ends: 157 [2019-10-13 20:12:17,709 INFO L226 Difference]: Without dead ends: 91 [2019-10-13 20:12:17,710 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:12:17,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-13 20:12:17,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 80. [2019-10-13 20:12:17,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-13 20:12:17,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2019-10-13 20:12:17,721 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 16 [2019-10-13 20:12:17,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:17,721 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2019-10-13 20:12:17,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 20:12:17,722 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2019-10-13 20:12:17,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 20:12:17,723 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:17,723 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:17,723 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:17,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:17,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1095322203, now seen corresponding path program 1 times [2019-10-13 20:12:17,724 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:17,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63121009] [2019-10-13 20:12:17,724 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:17,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:17,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:17,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:17,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63121009] [2019-10-13 20:12:17,770 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:17,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 20:12:17,770 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131622914] [2019-10-13 20:12:17,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 20:12:17,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:17,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 20:12:17,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:12:17,771 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 3 states. [2019-10-13 20:12:17,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:17,793 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2019-10-13 20:12:17,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:12:17,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 20:12:17,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:17,796 INFO L225 Difference]: With dead ends: 83 [2019-10-13 20:12:17,796 INFO L226 Difference]: Without dead ends: 81 [2019-10-13 20:12:17,797 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:12:17,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-13 20:12:17,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-10-13 20:12:17,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-13 20:12:17,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2019-10-13 20:12:17,812 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 21 [2019-10-13 20:12:17,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:17,813 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2019-10-13 20:12:17,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 20:12:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2019-10-13 20:12:17,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 20:12:17,815 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:17,815 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:17,815 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:17,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:17,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1095324125, now seen corresponding path program 1 times [2019-10-13 20:12:17,816 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:17,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143519103] [2019-10-13 20:12:17,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:17,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:17,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:17,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:17,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143519103] [2019-10-13 20:12:17,912 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:17,913 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 20:12:17,913 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463506992] [2019-10-13 20:12:17,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 20:12:17,914 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:17,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 20:12:17,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 20:12:17,914 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 4 states. [2019-10-13 20:12:17,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:17,985 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2019-10-13 20:12:17,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 20:12:17,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-13 20:12:17,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:17,987 INFO L225 Difference]: With dead ends: 101 [2019-10-13 20:12:17,987 INFO L226 Difference]: Without dead ends: 76 [2019-10-13 20:12:17,987 INFO L600 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-10-13 20:12:17,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-13 20:12:17,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-10-13 20:12:17,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-13 20:12:17,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2019-10-13 20:12:17,997 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 21 [2019-10-13 20:12:17,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:17,998 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2019-10-13 20:12:17,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 20:12:17,999 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2019-10-13 20:12:18,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 20:12:18,000 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:18,000 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:18,001 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:18,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:18,001 INFO L82 PathProgramCache]: Analyzing trace with hash -648846271, now seen corresponding path program 1 times [2019-10-13 20:12:18,002 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:18,002 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993576849] [2019-10-13 20:12:18,002 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:18,002 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:18,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:18,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993576849] [2019-10-13 20:12:18,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316194153] [2019-10-13 20:12:18,125 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-10-13 20:12:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:18,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-13 20:12:18,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:12:18,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 20:12:18,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:18,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:18,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 20:12:18,347 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-13 20:12:18,379 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:18,380 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 20:12:18,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:18,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:18,399 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 20:12:18,399 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:18,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:18,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 20:12:18,410 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2019-10-13 20:12:18,519 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-10-13 20:12:18,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 78 [2019-10-13 20:12:18,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:18,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:18,547 INFO L567 ElimStorePlain]: treesize reduction 32, result has 46.7 percent of original size [2019-10-13 20:12:18,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:18,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2019-10-13 20:12:18,638 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:18,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2019-10-13 20:12:18,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:18,656 INFO L567 ElimStorePlain]: treesize reduction 12, result has 42.9 percent of original size [2019-10-13 20:12:18,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 20:12:18,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-10-13 20:12:18,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:18,673 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:12:18,691 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:18,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:18,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:18,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2019-10-13 20:12:18,774 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1394 treesize of output 1362 [2019-10-13 20:12:18,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-13 20:12:19,103 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 34 [2019-10-13 20:12:19,103 INFO L567 ElimStorePlain]: treesize reduction 1270, result has 4.1 percent of original size [2019-10-13 20:12:19,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:19,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:19,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:19,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-13 20:12:19,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:43 [2019-10-13 20:12:19,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:19,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1774326573] [2019-10-13 20:12:19,210 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 24 [2019-10-13 20:12:19,263 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 20:12:19,264 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 20:12:19,350 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-13 20:12:19,352 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 19 root evaluator evaluations with a maximum evaluation depth of 0. Performed 19 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 30 variables. [2019-10-13 20:12:19,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:19,357 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-13 20:12:19,416 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-10-13 20:12:19,417 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-13 20:12:19,420 INFO L553 sIntCurrentIteration]: We unified 22 AI predicates to 22 [2019-10-13 20:12:19,420 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-13 20:12:19,421 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-13 20:12:19,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6, 6, 6] total 10 [2019-10-13 20:12:19,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148145456] [2019-10-13 20:12:19,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 20:12:19,422 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:19,423 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-13 20:12:19,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 20:12:19,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:12:19,423 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 2 states. [2019-10-13 20:12:19,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:19,426 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2019-10-13 20:12:19,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 20:12:19,427 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2019-10-13 20:12:19,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:19,428 INFO L225 Difference]: With dead ends: 76 [2019-10-13 20:12:19,428 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 20:12:19,434 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:12:19,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 20:12:19,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 20:12:19,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 20:12:19,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 20:12:19,435 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-10-13 20:12:19,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:19,435 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 20:12:19,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 20:12:19,436 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 20:12:19,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 20:12:19,640 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:12:19,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 20:12:19,692 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-13 20:12:19,692 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-13 20:12:19,692 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 20:12:19,692 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 20:12:19,693 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 20:12:19,693 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 20:12:19,693 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 20:12:19,693 INFO L443 ceAbstractionStarter]: For program point L1026-1(line 1026) no Hoare annotation was computed. [2019-10-13 20:12:19,693 INFO L443 ceAbstractionStarter]: For program point L1026-3(line 1026) no Hoare annotation was computed. [2019-10-13 20:12:19,693 INFO L443 ceAbstractionStarter]: For program point L1026-4(lines 1024 1028) no Hoare annotation was computed. [2019-10-13 20:12:19,693 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 982 1055) no Hoare annotation was computed. [2019-10-13 20:12:19,694 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1026) no Hoare annotation was computed. [2019-10-13 20:12:19,694 INFO L443 ceAbstractionStarter]: For program point L1027(line 1027) no Hoare annotation was computed. [2019-10-13 20:12:19,694 INFO L443 ceAbstractionStarter]: For program point L1027-1(line 1027) no Hoare annotation was computed. [2019-10-13 20:12:19,694 INFO L443 ceAbstractionStarter]: For program point L1027-3(line 1027) no Hoare annotation was computed. [2019-10-13 20:12:19,695 INFO L443 ceAbstractionStarter]: For program point L1027-4(lines 1024 1028) no Hoare annotation was computed. [2019-10-13 20:12:19,695 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 1034) no Hoare annotation was computed. [2019-10-13 20:12:19,695 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 982 1055) no Hoare annotation was computed. [2019-10-13 20:12:19,695 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2019-10-13 20:12:19,695 INFO L443 ceAbstractionStarter]: For program point L1029(lines 1029 1036) no Hoare annotation was computed. [2019-10-13 20:12:19,695 INFO L443 ceAbstractionStarter]: For program point L1013(line 1013) no Hoare annotation was computed. [2019-10-13 20:12:19,696 INFO L443 ceAbstractionStarter]: For program point L1013-2(line 1013) no Hoare annotation was computed. [2019-10-13 20:12:19,696 INFO L443 ceAbstractionStarter]: For program point L1013-3(lines 992 1015) no Hoare annotation was computed. [2019-10-13 20:12:19,696 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1025) no Hoare annotation was computed. [2019-10-13 20:12:19,696 INFO L443 ceAbstractionStarter]: For program point L997(lines 997 1011) no Hoare annotation was computed. [2019-10-13 20:12:19,696 INFO L443 ceAbstractionStarter]: For program point L1014(line 1014) no Hoare annotation was computed. [2019-10-13 20:12:19,696 INFO L443 ceAbstractionStarter]: For program point L1047-1(lines 983 1055) no Hoare annotation was computed. [2019-10-13 20:12:19,696 INFO L443 ceAbstractionStarter]: For program point L1047-2(lines 1047 1052) no Hoare annotation was computed. [2019-10-13 20:12:19,697 INFO L443 ceAbstractionStarter]: For program point L1014-2(line 1014) no Hoare annotation was computed. [2019-10-13 20:12:19,697 INFO L443 ceAbstractionStarter]: For program point L1014-3(lines 992 1015) no Hoare annotation was computed. [2019-10-13 20:12:19,697 INFO L439 ceAbstractionStarter]: At program point L1014-4(lines 991 1015) the Hoare annotation is: false [2019-10-13 20:12:19,697 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 1033) no Hoare annotation was computed. [2019-10-13 20:12:19,697 INFO L443 ceAbstractionStarter]: For program point L1031-1(line 1031) no Hoare annotation was computed. [2019-10-13 20:12:19,697 INFO L443 ceAbstractionStarter]: For program point L1031-3(line 1031) no Hoare annotation was computed. [2019-10-13 20:12:19,697 INFO L439 ceAbstractionStarter]: At program point L1031-4(line 1031) the Hoare annotation is: false [2019-10-13 20:12:19,697 INFO L443 ceAbstractionStarter]: For program point L1032(line 1032) no Hoare annotation was computed. [2019-10-13 20:12:19,698 INFO L443 ceAbstractionStarter]: For program point L1032-1(line 1032) no Hoare annotation was computed. [2019-10-13 20:12:19,699 INFO L443 ceAbstractionStarter]: For program point L1032-3(line 1032) no Hoare annotation was computed. [2019-10-13 20:12:19,699 INFO L443 ceAbstractionStarter]: For program point L1032-4(lines 1030 1036) no Hoare annotation was computed. [2019-10-13 20:12:19,699 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1021) no Hoare annotation was computed. [2019-10-13 20:12:19,699 INFO L443 ceAbstractionStarter]: For program point L1033(line 1033) no Hoare annotation was computed. [2019-10-13 20:12:19,699 INFO L443 ceAbstractionStarter]: For program point L1033-1(line 1033) no Hoare annotation was computed. [2019-10-13 20:12:19,699 INFO L443 ceAbstractionStarter]: For program point L1033-3(line 1033) no Hoare annotation was computed. [2019-10-13 20:12:19,699 INFO L443 ceAbstractionStarter]: For program point L1033-4(lines 1030 1036) no Hoare annotation was computed. [2019-10-13 20:12:19,700 INFO L443 ceAbstractionStarter]: For program point L1017(line 1017) no Hoare annotation was computed. [2019-10-13 20:12:19,700 INFO L443 ceAbstractionStarter]: For program point L1017-2(line 1017) no Hoare annotation was computed. [2019-10-13 20:12:19,700 INFO L443 ceAbstractionStarter]: For program point L1017-3(lines 983 1055) no Hoare annotation was computed. [2019-10-13 20:12:19,700 INFO L443 ceAbstractionStarter]: For program point L1017-4(lines 983 1055) no Hoare annotation was computed. [2019-10-13 20:12:19,700 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 1032) no Hoare annotation was computed. [2019-10-13 20:12:19,702 INFO L443 ceAbstractionStarter]: For program point L1034(line 1034) no Hoare annotation was computed. [2019-10-13 20:12:19,702 INFO L443 ceAbstractionStarter]: For program point L1034-1(line 1034) no Hoare annotation was computed. [2019-10-13 20:12:19,703 INFO L443 ceAbstractionStarter]: For program point L1034-3(line 1034) no Hoare annotation was computed. [2019-10-13 20:12:19,703 INFO L443 ceAbstractionStarter]: For program point L1034-4(lines 1030 1036) no Hoare annotation was computed. [2019-10-13 20:12:19,703 INFO L443 ceAbstractionStarter]: For program point L1018(lines 983 1055) no Hoare annotation was computed. [2019-10-13 20:12:19,703 INFO L443 ceAbstractionStarter]: For program point L1035(line 1035) no Hoare annotation was computed. [2019-10-13 20:12:19,703 INFO L443 ceAbstractionStarter]: For program point L1002(lines 1002 1011) no Hoare annotation was computed. [2019-10-13 20:12:19,703 INFO L443 ceAbstractionStarter]: For program point L1035-1(line 1035) no Hoare annotation was computed. [2019-10-13 20:12:19,703 INFO L443 ceAbstractionStarter]: For program point L1035-3(line 1035) no Hoare annotation was computed. [2019-10-13 20:12:19,704 INFO L443 ceAbstractionStarter]: For program point L1035-4(lines 1030 1036) no Hoare annotation was computed. [2019-10-13 20:12:19,704 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1020) no Hoare annotation was computed. [2019-10-13 20:12:19,704 INFO L443 ceAbstractionStarter]: For program point L1020-1(line 1020) no Hoare annotation was computed. [2019-10-13 20:12:19,704 INFO L443 ceAbstractionStarter]: For program point L1020-3(line 1020) no Hoare annotation was computed. [2019-10-13 20:12:19,704 INFO L439 ceAbstractionStarter]: At program point L1020-4(line 1020) the Hoare annotation is: false [2019-10-13 20:12:19,705 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 1031) no Hoare annotation was computed. [2019-10-13 20:12:19,705 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 982 1055) the Hoare annotation is: true [2019-10-13 20:12:19,705 INFO L443 ceAbstractionStarter]: For program point L1021(line 1021) no Hoare annotation was computed. [2019-10-13 20:12:19,705 INFO L443 ceAbstractionStarter]: For program point L1021-1(line 1021) no Hoare annotation was computed. [2019-10-13 20:12:19,705 INFO L443 ceAbstractionStarter]: For program point L1021-3(line 1021) no Hoare annotation was computed. [2019-10-13 20:12:19,706 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 1042) no Hoare annotation was computed. [2019-10-13 20:12:19,706 INFO L443 ceAbstractionStarter]: For program point L1021-4(lines 1019 1022) no Hoare annotation was computed. [2019-10-13 20:12:19,706 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1017) no Hoare annotation was computed. [2019-10-13 20:12:19,706 INFO L443 ceAbstractionStarter]: For program point L1023(lines 983 1055) no Hoare annotation was computed. [2019-10-13 20:12:19,706 INFO L443 ceAbstractionStarter]: For program point L1007(lines 1007 1011) no Hoare annotation was computed. [2019-10-13 20:12:19,706 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 1027) no Hoare annotation was computed. [2019-10-13 20:12:19,706 INFO L443 ceAbstractionStarter]: For program point L1040-1(line 1040) no Hoare annotation was computed. [2019-10-13 20:12:19,707 INFO L443 ceAbstractionStarter]: For program point L1040-3(lines 1040 1044) no Hoare annotation was computed. [2019-10-13 20:12:19,707 INFO L439 ceAbstractionStarter]: At program point L1040-5(lines 1040 1044) the Hoare annotation is: (and (= main_~status~0 0) (not (= 0 main_~head~0.base))) [2019-10-13 20:12:19,707 INFO L443 ceAbstractionStarter]: For program point L991-1(lines 991 1015) no Hoare annotation was computed. [2019-10-13 20:12:19,707 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 1035) no Hoare annotation was computed. [2019-10-13 20:12:19,707 INFO L443 ceAbstractionStarter]: For program point L1025-1(line 1025) no Hoare annotation was computed. [2019-10-13 20:12:19,707 INFO L443 ceAbstractionStarter]: For program point L1025-3(line 1025) no Hoare annotation was computed. [2019-10-13 20:12:19,707 INFO L439 ceAbstractionStarter]: At program point L1025-4(line 1025) the Hoare annotation is: false [2019-10-13 20:12:19,708 INFO L443 ceAbstractionStarter]: For program point L1042-1(line 1042) no Hoare annotation was computed. [2019-10-13 20:12:19,708 INFO L443 ceAbstractionStarter]: For program point L1042-3(line 1042) no Hoare annotation was computed. [2019-10-13 20:12:19,708 INFO L443 ceAbstractionStarter]: For program point L1042-4(line 1042) no Hoare annotation was computed. [2019-10-13 20:12:19,708 INFO L443 ceAbstractionStarter]: For program point L1042-6(line 1042) no Hoare annotation was computed. [2019-10-13 20:12:19,708 INFO L439 ceAbstractionStarter]: At program point L1042-7(line 1042) the Hoare annotation is: (and (= main_~status~0 0) (not (= 0 main_~head~0.base))) [2019-10-13 20:12:19,708 INFO L443 ceAbstractionStarter]: For program point L1042-8(line 1042) no Hoare annotation was computed. [2019-10-13 20:12:19,708 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1014) no Hoare annotation was computed. [2019-10-13 20:12:19,709 INFO L443 ceAbstractionStarter]: For program point L1026(line 1026) no Hoare annotation was computed. [2019-10-13 20:12:19,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 08:12:19 BoogieIcfgContainer [2019-10-13 20:12:19,725 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 20:12:19,727 INFO L168 Benchmark]: Toolchain (without parser) took 4534.31 ms. Allocated memory was 143.7 MB in the beginning and 251.7 MB in the end (delta: 108.0 MB). Free memory was 100.0 MB in the beginning and 138.8 MB in the end (delta: -38.8 MB). Peak memory consumption was 69.2 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:19,728 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 143.7 MB. Free memory was 120.1 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 20:12:19,729 INFO L168 Benchmark]: CACSL2BoogieTranslator took 668.38 ms. Allocated memory was 143.7 MB in the beginning and 200.3 MB in the end (delta: 56.6 MB). Free memory was 99.8 MB in the beginning and 166.5 MB in the end (delta: -66.6 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:19,738 INFO L168 Benchmark]: Boogie Preprocessor took 76.83 ms. Allocated memory is still 200.3 MB. Free memory was 166.5 MB in the beginning and 163.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:19,740 INFO L168 Benchmark]: RCFGBuilder took 799.28 ms. Allocated memory is still 200.3 MB. Free memory was 163.0 MB in the beginning and 108.5 MB in the end (delta: 54.4 MB). Peak memory consumption was 54.4 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:19,743 INFO L168 Benchmark]: TraceAbstraction took 2985.46 ms. Allocated memory was 200.3 MB in the beginning and 251.7 MB in the end (delta: 51.4 MB). Free memory was 108.5 MB in the beginning and 138.8 MB in the end (delta: -30.3 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:19,751 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 143.7 MB. Free memory was 120.1 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 668.38 ms. Allocated memory was 143.7 MB in the beginning and 200.3 MB in the end (delta: 56.6 MB). Free memory was 99.8 MB in the beginning and 166.5 MB in the end (delta: -66.6 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 76.83 ms. Allocated memory is still 200.3 MB. Free memory was 166.5 MB in the beginning and 163.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 799.28 ms. Allocated memory is still 200.3 MB. Free memory was 163.0 MB in the beginning and 108.5 MB in the end (delta: 54.4 MB). Peak memory consumption was 54.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2985.46 ms. Allocated memory was 200.3 MB in the beginning and 251.7 MB in the end (delta: 51.4 MB). Free memory was 108.5 MB in the beginning and 138.8 MB in the end (delta: -30.3 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1014]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1031]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1017]: 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: 1013]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1033]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1020]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1027]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1021]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1026]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1025]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1035]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1034]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1042]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 1031]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1020]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1025]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 991]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1042]: Loop Invariant Derived loop invariant: status == 0 && !(0 == head) - InvariantResult [Line: 1040]: Loop Invariant Derived loop invariant: status == 0 && !(0 == head) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 90 locations, 14 error locations. Result: SAFE, OverallTime: 2.9s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 481 SDtfs, 157 SDslu, 300 SDs, 0 SdLazy, 74 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 12 NumberOfFragments, 24 HoareAnnotationTreeSize, 10 FomulaSimplifications, 18 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 150 ConstructedInterpolants, 15 QuantifiedInterpolants, 18295 SizeOfPredicates, 9 NumberOfNonLiveVariables, 102 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 0/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 147, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9204545454545454, AVG_VARS_REMOVED_DURING_WEAKENING: 0.6818181818181818, AVG_WEAKENED_CONJUNCTS: 0.2727272727272727, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...