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/dll-rb-sentinel-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 00:10:58,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 00:10:58,961 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 00:10:58,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 00:10:58,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 00:10:58,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 00:10:58,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 00:10:58,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 00:10:58,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 00:10:58,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 00:10:58,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 00:10:58,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 00:10:58,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 00:10:58,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 00:10:59,000 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 00:10:59,001 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 00:10:59,002 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 00:10:59,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 00:10:59,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 00:10:59,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 00:10:59,007 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 00:10:59,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 00:10:59,009 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 00:10:59,010 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 00:10:59,012 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 00:10:59,012 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 00:10:59,012 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 00:10:59,013 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 00:10:59,013 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 00:10:59,014 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 00:10:59,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 00:10:59,015 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 00:10:59,016 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 00:10:59,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 00:10:59,019 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 00:10:59,019 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 00:10:59,022 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 00:10:59,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 00:10:59,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 00:10:59,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 00:10:59,024 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 00:10:59,028 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-15 00:10:59,044 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 00:10:59,044 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 00:10:59,045 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 00:10:59,046 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 00:10:59,046 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 00:10:59,046 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 00:10:59,046 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 00:10:59,047 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 00:10:59,047 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 00:10:59,047 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 00:10:59,047 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 00:10:59,047 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 00:10:59,047 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 00:10:59,048 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 00:10:59,048 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 00:10:59,048 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 00:10:59,048 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 00:10:59,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 00:10:59,049 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 00:10:59,049 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 00:10:59,049 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 00:10:59,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 00:10:59,049 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 00:10:59,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 00:10:59,050 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 00:10:59,050 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 00:10:59,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 00:10:59,050 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 00:10:59,051 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-15 00:10:59,328 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 00:10:59,350 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 00:10:59,356 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 00:10:59,357 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 00:10:59,358 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 00:10:59,358 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel-2.i [2019-10-15 00:10:59,434 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96138c8a0/0c9dff47376949528dc18394de95c836/FLAGfe66ce1f5 [2019-10-15 00:10:59,997 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 00:10:59,998 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-sentinel-2.i [2019-10-15 00:11:00,011 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96138c8a0/0c9dff47376949528dc18394de95c836/FLAGfe66ce1f5 [2019-10-15 00:11:00,295 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96138c8a0/0c9dff47376949528dc18394de95c836 [2019-10-15 00:11:00,303 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 00:11:00,305 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 00:11:00,306 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 00:11:00,306 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 00:11:00,310 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 00:11:00,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:11:00" (1/1) ... [2019-10-15 00:11:00,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@465ce920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:00, skipping insertion in model container [2019-10-15 00:11:00,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:11:00" (1/1) ... [2019-10-15 00:11:00,327 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 00:11:00,385 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 00:11:00,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:11:00,806 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 00:11:00,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:11:00,902 INFO L192 MainTranslator]: Completed translation [2019-10-15 00:11:00,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:00 WrapperNode [2019-10-15 00:11:00,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 00:11:00,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 00:11:00,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 00:11:00,904 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 00:11:00,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:00" (1/1) ... [2019-10-15 00:11:00,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:00" (1/1) ... [2019-10-15 00:11:00,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:00" (1/1) ... [2019-10-15 00:11:00,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:00" (1/1) ... [2019-10-15 00:11:00,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:00" (1/1) ... [2019-10-15 00:11:00,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:00" (1/1) ... [2019-10-15 00:11:00,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:00" (1/1) ... [2019-10-15 00:11:00,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 00:11:00,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 00:11:00,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 00:11:00,974 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 00:11:00,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:00" (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-15 00:11:01,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 00:11:01,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 00:11:01,038 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 00:11:01,039 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-15 00:11:01,039 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-15 00:11:01,039 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-15 00:11:01,039 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-15 00:11:01,039 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-15 00:11:01,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-15 00:11:01,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-15 00:11:01,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-15 00:11:01,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-15 00:11:01,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-15 00:11:01,041 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-15 00:11:01,041 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-15 00:11:01,041 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-15 00:11:01,041 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-15 00:11:01,041 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-15 00:11:01,041 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-15 00:11:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-15 00:11:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-15 00:11:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-15 00:11:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-15 00:11:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-15 00:11:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-15 00:11:01,043 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-15 00:11:01,043 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-15 00:11:01,043 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-15 00:11:01,043 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-15 00:11:01,043 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-15 00:11:01,043 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-15 00:11:01,044 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-15 00:11:01,044 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-15 00:11:01,044 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-15 00:11:01,044 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-15 00:11:01,044 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-15 00:11:01,044 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-15 00:11:01,045 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-15 00:11:01,045 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-15 00:11:01,045 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-15 00:11:01,045 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-15 00:11:01,045 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-15 00:11:01,045 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-15 00:11:01,046 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-15 00:11:01,046 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-15 00:11:01,046 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-15 00:11:01,046 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-15 00:11:01,046 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-15 00:11:01,046 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-15 00:11:01,047 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-15 00:11:01,047 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-15 00:11:01,047 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-15 00:11:01,047 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-15 00:11:01,047 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 00:11:01,047 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-15 00:11:01,047 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-15 00:11:01,048 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 00:11:01,048 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-15 00:11:01,048 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-15 00:11:01,048 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-15 00:11:01,048 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-15 00:11:01,048 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-15 00:11:01,049 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-15 00:11:01,050 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-15 00:11:01,050 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-15 00:11:01,050 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-15 00:11:01,051 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 00:11:01,051 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-15 00:11:01,051 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-15 00:11:01,051 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-15 00:11:01,051 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-15 00:11:01,051 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-15 00:11:01,052 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-15 00:11:01,052 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-15 00:11:01,052 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-15 00:11:01,052 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-15 00:11:01,052 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-15 00:11:01,052 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-15 00:11:01,053 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-15 00:11:01,053 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-15 00:11:01,053 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-15 00:11:01,053 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-15 00:11:01,053 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-15 00:11:01,053 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-15 00:11:01,053 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-15 00:11:01,054 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-15 00:11:01,054 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-15 00:11:01,054 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-15 00:11:01,054 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-15 00:11:01,054 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-15 00:11:01,054 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-15 00:11:01,055 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-15 00:11:01,055 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-15 00:11:01,055 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-15 00:11:01,055 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-15 00:11:01,055 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-15 00:11:01,055 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-15 00:11:01,055 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-15 00:11:01,056 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-15 00:11:01,056 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-15 00:11:01,056 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-15 00:11:01,056 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-15 00:11:01,056 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-15 00:11:01,056 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-15 00:11:01,056 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-15 00:11:01,057 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-15 00:11:01,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 00:11:01,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 00:11:01,057 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 00:11:01,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 00:11:01,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 00:11:01,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 00:11:01,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 00:11:01,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 00:11:01,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 00:11:01,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 00:11:01,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 00:11:01,724 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 00:11:01,725 INFO L284 CfgBuilder]: Removed 17 assume(true) statements. [2019-10-15 00:11:01,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:11:01 BoogieIcfgContainer [2019-10-15 00:11:01,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 00:11:01,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 00:11:01,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 00:11:01,732 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 00:11:01,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 12:11:00" (1/3) ... [2019-10-15 00:11:01,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420363eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:11:01, skipping insertion in model container [2019-10-15 00:11:01,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:00" (2/3) ... [2019-10-15 00:11:01,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420363eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:11:01, skipping insertion in model container [2019-10-15 00:11:01,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:11:01" (3/3) ... [2019-10-15 00:11:01,736 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-2.i [2019-10-15 00:11:01,747 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 00:11:01,755 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-10-15 00:11:01,768 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-10-15 00:11:01,794 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 00:11:01,794 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 00:11:01,794 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 00:11:01,795 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 00:11:01,795 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 00:11:01,795 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 00:11:01,796 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 00:11:01,796 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 00:11:01,816 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-10-15 00:11:01,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-15 00:11:01,824 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:01,825 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:01,828 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:01,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:01,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1255802584, now seen corresponding path program 1 times [2019-10-15 00:11:01,845 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:01,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603744191] [2019-10-15 00:11:01,846 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:01,846 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:01,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:02,028 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-15 00:11:02,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603744191] [2019-10-15 00:11:02,030 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:02,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-15 00:11:02,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836555377] [2019-10-15 00:11:02,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 00:11:02,038 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:02,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 00:11:02,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 00:11:02,059 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2019-10-15 00:11:02,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:02,091 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2019-10-15 00:11:02,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 00:11:02,093 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-15 00:11:02,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:02,105 INFO L225 Difference]: With dead ends: 98 [2019-10-15 00:11:02,105 INFO L226 Difference]: Without dead ends: 45 [2019-10-15 00:11:02,110 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-15 00:11:02,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-15 00:11:02,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-15 00:11:02,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-15 00:11:02,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-10-15 00:11:02,158 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 10 [2019-10-15 00:11:02,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:02,158 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-10-15 00:11:02,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 00:11:02,159 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-10-15 00:11:02,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-15 00:11:02,160 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:02,160 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:02,160 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:02,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:02,161 INFO L82 PathProgramCache]: Analyzing trace with hash -338068956, now seen corresponding path program 1 times [2019-10-15 00:11:02,161 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:02,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502872446] [2019-10-15 00:11:02,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:02,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:02,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:02,307 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-15 00:11:02,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502872446] [2019-10-15 00:11:02,309 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:02,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:11:02,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416622463] [2019-10-15 00:11:02,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:11:02,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:02,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:11:02,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:11:02,312 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 4 states. [2019-10-15 00:11:02,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:02,413 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2019-10-15 00:11:02,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:11:02,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-15 00:11:02,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:02,416 INFO L225 Difference]: With dead ends: 51 [2019-10-15 00:11:02,416 INFO L226 Difference]: Without dead ends: 49 [2019-10-15 00:11:02,417 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-15 00:11:02,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-15 00:11:02,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2019-10-15 00:11:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-15 00:11:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-10-15 00:11:02,424 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 11 [2019-10-15 00:11:02,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:02,424 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-10-15 00:11:02,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:11:02,425 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-10-15 00:11:02,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-15 00:11:02,425 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:02,426 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:02,426 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:02,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:02,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1890143313, now seen corresponding path program 1 times [2019-10-15 00:11:02,427 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:02,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675555709] [2019-10-15 00:11:02,427 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:02,427 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:02,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:02,518 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-15 00:11:02,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675555709] [2019-10-15 00:11:02,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:02,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:11:02,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703678664] [2019-10-15 00:11:02,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:11:02,520 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:02,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:11:02,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:11:02,520 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 4 states. [2019-10-15 00:11:02,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:02,595 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-10-15 00:11:02,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:11:02,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-15 00:11:02,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:02,599 INFO L225 Difference]: With dead ends: 43 [2019-10-15 00:11:02,600 INFO L226 Difference]: Without dead ends: 41 [2019-10-15 00:11:02,600 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-15 00:11:02,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-15 00:11:02,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-15 00:11:02,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-15 00:11:02,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-10-15 00:11:02,609 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 12 [2019-10-15 00:11:02,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:02,610 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-10-15 00:11:02,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:11:02,611 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-10-15 00:11:02,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 00:11:02,612 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:02,612 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:02,612 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:02,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:02,613 INFO L82 PathProgramCache]: Analyzing trace with hash 290038970, now seen corresponding path program 1 times [2019-10-15 00:11:02,614 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:02,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580791764] [2019-10-15 00:11:02,615 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:02,617 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:02,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:02,780 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-15 00:11:02,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580791764] [2019-10-15 00:11:02,781 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:02,781 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 00:11:02,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228333863] [2019-10-15 00:11:02,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 00:11:02,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:02,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 00:11:02,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-15 00:11:02,786 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2019-10-15 00:11:03,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:03,092 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2019-10-15 00:11:03,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 00:11:03,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-10-15 00:11:03,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:03,095 INFO L225 Difference]: With dead ends: 82 [2019-10-15 00:11:03,095 INFO L226 Difference]: Without dead ends: 80 [2019-10-15 00:11:03,096 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-10-15 00:11:03,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-15 00:11:03,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 59. [2019-10-15 00:11:03,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-15 00:11:03,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2019-10-15 00:11:03,114 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 14 [2019-10-15 00:11:03,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:03,115 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2019-10-15 00:11:03,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 00:11:03,115 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2019-10-15 00:11:03,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 00:11:03,116 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:03,116 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:03,116 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:03,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:03,117 INFO L82 PathProgramCache]: Analyzing trace with hash 2060721718, now seen corresponding path program 1 times [2019-10-15 00:11:03,117 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:03,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55903379] [2019-10-15 00:11:03,118 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:03,118 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:03,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:03,245 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-15 00:11:03,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55903379] [2019-10-15 00:11:03,247 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:03,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:11:03,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602404910] [2019-10-15 00:11:03,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:11:03,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:03,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:11:03,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:11:03,249 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand 4 states. [2019-10-15 00:11:03,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:03,361 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2019-10-15 00:11:03,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:11:03,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-15 00:11:03,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:03,365 INFO L225 Difference]: With dead ends: 59 [2019-10-15 00:11:03,365 INFO L226 Difference]: Without dead ends: 57 [2019-10-15 00:11:03,365 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-15 00:11:03,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-15 00:11:03,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-10-15 00:11:03,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-15 00:11:03,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2019-10-15 00:11:03,382 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 15 [2019-10-15 00:11:03,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:03,383 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2019-10-15 00:11:03,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:11:03,383 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2019-10-15 00:11:03,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 00:11:03,384 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:03,384 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:03,385 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:03,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:03,387 INFO L82 PathProgramCache]: Analyzing trace with hash 373775322, now seen corresponding path program 1 times [2019-10-15 00:11:03,387 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:03,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738757465] [2019-10-15 00:11:03,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:03,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:03,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:03,522 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-15 00:11:03,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738757465] [2019-10-15 00:11:03,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:03,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:11:03,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038346576] [2019-10-15 00:11:03,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:11:03,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:03,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:11:03,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:11:03,527 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 4 states. [2019-10-15 00:11:03,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:03,597 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2019-10-15 00:11:03,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:11:03,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-15 00:11:03,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:03,599 INFO L225 Difference]: With dead ends: 57 [2019-10-15 00:11:03,599 INFO L226 Difference]: Without dead ends: 55 [2019-10-15 00:11:03,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-15 00:11:03,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-15 00:11:03,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-10-15 00:11:03,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-15 00:11:03,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2019-10-15 00:11:03,614 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 17 [2019-10-15 00:11:03,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:03,614 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2019-10-15 00:11:03,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:11:03,616 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2019-10-15 00:11:03,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 00:11:03,618 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:03,618 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:03,619 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:03,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:03,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1568846049, now seen corresponding path program 1 times [2019-10-15 00:11:03,620 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:03,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015661009] [2019-10-15 00:11:03,620 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:03,621 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:03,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:03,755 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-15 00:11:03,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015661009] [2019-10-15 00:11:03,756 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:03,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 00:11:03,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534683185] [2019-10-15 00:11:03,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:11:03,757 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:03,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:11:03,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:11:03,758 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 5 states. [2019-10-15 00:11:03,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:03,890 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2019-10-15 00:11:03,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 00:11:03,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-15 00:11:03,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:03,898 INFO L225 Difference]: With dead ends: 70 [2019-10-15 00:11:03,898 INFO L226 Difference]: Without dead ends: 58 [2019-10-15 00:11:03,898 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 00:11:03,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-15 00:11:03,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-10-15 00:11:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-15 00:11:03,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2019-10-15 00:11:03,905 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 18 [2019-10-15 00:11:03,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:03,905 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2019-10-15 00:11:03,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:11:03,906 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2019-10-15 00:11:03,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 00:11:03,906 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:03,907 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] [2019-10-15 00:11:03,907 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:03,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:03,907 INFO L82 PathProgramCache]: Analyzing trace with hash 777661568, now seen corresponding path program 1 times [2019-10-15 00:11:03,908 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:03,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797124855] [2019-10-15 00:11:03,908 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:03,908 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:03,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:03,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:03,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797124855] [2019-10-15 00:11:03,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091350465] [2019-10-15 00:11:03,987 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-15 00:11:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:04,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-15 00:11:04,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:11:04,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:04,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:04,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:04,180 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-10-15 00:11:04,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:04,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:04,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:04,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:04,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:04,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-10-15 00:11:04,210 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:04,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:04,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 00:11:04,219 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-10-15 00:11:04,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:04,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-10-15 00:11:04,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:04,284 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:04,289 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-10-15 00:11:04,289 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-10-15 00:11:04,290 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:04,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:04,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 00:11:04,297 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2019-10-15 00:11:04,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:04,319 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:11:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:04,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [754527237] [2019-10-15 00:11:04,394 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 22 [2019-10-15 00:11:04,432 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 00:11:04,432 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 00:11:04,491 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-15 00:11:04,493 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 35 variables. [2019-10-15 00:11:04,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:04,497 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-15 00:11:04,529 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-10-15 00:11:04,530 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-15 00:11:04,531 INFO L553 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2019-10-15 00:11:04,531 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-15 00:11:04,532 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-15 00:11:04,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5, 5, 5] total 10 [2019-10-15 00:11:04,532 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805397750] [2019-10-15 00:11:04,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 00:11:04,534 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:04,534 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-15 00:11:04,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 00:11:04,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 00:11:04,535 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 2 states. [2019-10-15 00:11:04,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:04,536 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-10-15 00:11:04,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 00:11:04,537 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2019-10-15 00:11:04,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:04,537 INFO L225 Difference]: With dead ends: 57 [2019-10-15 00:11:04,537 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 00:11:04,538 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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-15 00:11:04,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 00:11:04,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 00:11:04,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 00:11:04,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 00:11:04,539 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-10-15 00:11:04,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:04,539 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 00:11:04,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 00:11:04,539 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 00:11:04,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 00:11:04,740 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:11:04,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 00:11:04,765 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-15 00:11:04,766 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-15 00:11:04,766 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 00:11:04,766 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 00:11:04,767 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 00:11:04,767 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 00:11:04,767 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 00:11:04,767 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 993 1073) no Hoare annotation was computed. [2019-10-15 00:11:04,767 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1039) no Hoare annotation was computed. [2019-10-15 00:11:04,767 INFO L443 ceAbstractionStarter]: For program point L1053-1(lines 1053 1068) no Hoare annotation was computed. [2019-10-15 00:11:04,767 INFO L443 ceAbstractionStarter]: For program point L1045-1(line 1045) no Hoare annotation was computed. [2019-10-15 00:11:04,767 INFO L443 ceAbstractionStarter]: For program point L1045-3(line 1045) no Hoare annotation was computed. [2019-10-15 00:11:04,768 INFO L439 ceAbstractionStarter]: At program point L1045-4(line 1045) the Hoare annotation is: false [2019-10-15 00:11:04,768 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1031) no Hoare annotation was computed. [2019-10-15 00:11:04,768 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 993 1073) no Hoare annotation was computed. [2019-10-15 00:11:04,768 INFO L443 ceAbstractionStarter]: For program point L1029(line 1029) no Hoare annotation was computed. [2019-10-15 00:11:04,768 INFO L443 ceAbstractionStarter]: For program point L1029-1(line 1029) no Hoare annotation was computed. [2019-10-15 00:11:04,768 INFO L443 ceAbstractionStarter]: For program point L1029-3(line 1029) no Hoare annotation was computed. [2019-10-15 00:11:04,768 INFO L443 ceAbstractionStarter]: For program point L1029-4(lines 1009 1032) no Hoare annotation was computed. [2019-10-15 00:11:04,768 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 993 1073) the Hoare annotation is: true [2019-10-15 00:11:04,769 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1045) no Hoare annotation was computed. [2019-10-15 00:11:04,769 INFO L443 ceAbstractionStarter]: For program point L1046(line 1046) no Hoare annotation was computed. [2019-10-15 00:11:04,769 INFO L443 ceAbstractionStarter]: For program point L1046-1(line 1046) no Hoare annotation was computed. [2019-10-15 00:11:04,769 INFO L443 ceAbstractionStarter]: For program point L1046-3(line 1046) no Hoare annotation was computed. [2019-10-15 00:11:04,769 INFO L443 ceAbstractionStarter]: For program point L1046-4(lines 1043 1047) no Hoare annotation was computed. [2019-10-15 00:11:04,769 INFO L443 ceAbstractionStarter]: For program point L1038-1(line 1038) no Hoare annotation was computed. [2019-10-15 00:11:04,769 INFO L443 ceAbstractionStarter]: For program point L1038-3(line 1038) no Hoare annotation was computed. [2019-10-15 00:11:04,770 INFO L439 ceAbstractionStarter]: At program point L1038-4(line 1038) the Hoare annotation is: false [2019-10-15 00:11:04,770 INFO L443 ceAbstractionStarter]: For program point L1030(line 1030) no Hoare annotation was computed. [2019-10-15 00:11:04,770 INFO L443 ceAbstractionStarter]: For program point L1030-1(line 1030) no Hoare annotation was computed. [2019-10-15 00:11:04,770 INFO L443 ceAbstractionStarter]: For program point L1030-3(line 1030) no Hoare annotation was computed. [2019-10-15 00:11:04,770 INFO L443 ceAbstractionStarter]: For program point L1030-4(lines 1009 1032) no Hoare annotation was computed. [2019-10-15 00:11:04,770 INFO L443 ceAbstractionStarter]: For program point L1055(lines 1055 1067) no Hoare annotation was computed. [2019-10-15 00:11:04,770 INFO L443 ceAbstractionStarter]: For program point L1055-2(lines 994 1073) no Hoare annotation was computed. [2019-10-15 00:11:04,771 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1029) no Hoare annotation was computed. [2019-10-15 00:11:04,771 INFO L443 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-10-15 00:11:04,771 INFO L443 ceAbstractionStarter]: For program point L1039-1(line 1039) no Hoare annotation was computed. [2019-10-15 00:11:04,771 INFO L443 ceAbstractionStarter]: For program point L1039-3(line 1039) no Hoare annotation was computed. [2019-10-15 00:11:04,771 INFO L443 ceAbstractionStarter]: For program point L1039-4(lines 994 1073) no Hoare annotation was computed. [2019-10-15 00:11:04,771 INFO L443 ceAbstractionStarter]: For program point L1031(line 1031) no Hoare annotation was computed. [2019-10-15 00:11:04,771 INFO L443 ceAbstractionStarter]: For program point L1031-2(line 1031) no Hoare annotation was computed. [2019-10-15 00:11:04,772 INFO L443 ceAbstractionStarter]: For program point L1031-3(lines 1009 1032) no Hoare annotation was computed. [2019-10-15 00:11:04,772 INFO L439 ceAbstractionStarter]: At program point L1031-4(lines 1008 1032) the Hoare annotation is: false [2019-10-15 00:11:04,772 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1038) no Hoare annotation was computed. [2019-10-15 00:11:04,772 INFO L443 ceAbstractionStarter]: For program point L1040-1(lines 994 1073) no Hoare annotation was computed. [2019-10-15 00:11:04,772 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1028) no Hoare annotation was computed. [2019-10-15 00:11:04,772 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1046) no Hoare annotation was computed. [2019-10-15 00:11:04,773 INFO L443 ceAbstractionStarter]: For program point L1008-1(lines 1008 1032) no Hoare annotation was computed. [2019-10-15 00:11:04,773 INFO L443 ceAbstractionStarter]: For program point L1008-3(lines 1008 1032) no Hoare annotation was computed. [2019-10-15 00:11:04,773 INFO L443 ceAbstractionStarter]: For program point L1042(lines 1042 1047) no Hoare annotation was computed. [2019-10-15 00:11:04,773 INFO L443 ceAbstractionStarter]: For program point L1042-1(lines 1042 1047) no Hoare annotation was computed. [2019-10-15 00:11:04,773 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1030) no Hoare annotation was computed. [2019-10-15 00:11:04,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 12:11:04 BoogieIcfgContainer [2019-10-15 00:11:04,782 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 00:11:04,784 INFO L168 Benchmark]: Toolchain (without parser) took 4479.04 ms. Allocated memory was 138.4 MB in the beginning and 247.5 MB in the end (delta: 109.1 MB). Free memory was 100.8 MB in the beginning and 127.1 MB in the end (delta: -26.3 MB). Peak memory consumption was 82.8 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:04,785 INFO L168 Benchmark]: CDTParser took 1.25 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 00:11:04,786 INFO L168 Benchmark]: CACSL2BoogieTranslator took 597.36 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 169.1 MB in the end (delta: -68.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:04,786 INFO L168 Benchmark]: Boogie Preprocessor took 70.09 ms. Allocated memory is still 202.9 MB. Free memory was 169.1 MB in the beginning and 166.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:04,787 INFO L168 Benchmark]: RCFGBuilder took 752.48 ms. Allocated memory is still 202.9 MB. Free memory was 165.6 MB in the beginning and 115.0 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:04,788 INFO L168 Benchmark]: TraceAbstraction took 3054.29 ms. Allocated memory was 202.9 MB in the beginning and 247.5 MB in the end (delta: 44.6 MB). Free memory was 114.4 MB in the beginning and 127.1 MB in the end (delta: -12.7 MB). Peak memory consumption was 31.8 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:04,792 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.25 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 597.36 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 169.1 MB in the end (delta: -68.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.09 ms. Allocated memory is still 202.9 MB. Free memory was 169.1 MB in the beginning and 166.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 752.48 ms. Allocated memory is still 202.9 MB. Free memory was 165.6 MB in the beginning and 115.0 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3054.29 ms. Allocated memory was 202.9 MB in the beginning and 247.5 MB in the end (delta: 44.6 MB). Free memory was 114.4 MB in the beginning and 127.1 MB in the end (delta: -12.7 MB). Peak memory consumption was 31.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1046]: 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: 1038]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1030]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1039]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1029]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1045]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 1038]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1008]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1045]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 52 locations, 7 error locations. Result: SAFE, OverallTime: 2.9s, OverallIterations: 8, TraceHistogramMax: 2, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 259 SDtfs, 173 SDslu, 322 SDs, 0 SdLazy, 245 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 28 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 139 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 19774 SizeOfPredicates, 8 NumberOfNonLiveVariables, 103 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 3/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 104, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.875, AVG_VARS_REMOVED_DURING_WEAKENING: 1.05, AVG_WEAKENED_CONJUNCTS: 0.3, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...