/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/forester-heap/dll-token-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:59:04,999 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:59:05,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:59:05,019 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:59:05,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:59:05,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:59:05,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:59:05,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:59:05,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:59:05,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:59:05,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:59:05,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:59:05,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:59:05,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:59:05,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:59:05,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:59:05,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:59:05,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:59:05,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:59:05,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:59:05,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:59:05,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:59:05,042 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:59:05,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:59:05,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:59:05,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:59:05,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:59:05,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:59:05,054 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:59:05,055 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:59:05,055 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:59:05,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:59:05,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:59:05,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:59:05,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:59:05,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:59:05,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:59:05,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:59:05,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:59:05,067 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:59:05,067 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:59:05,071 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 22:59:05,092 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:59:05,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:59:05,093 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:59:05,093 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:59:05,094 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:59:05,094 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:59:05,094 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:59:05,095 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:59:05,095 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:59:05,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:59:05,096 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:59:05,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:59:05,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:59:05,097 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:59:05,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:59:05,098 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:59:05,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:59:05,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:59:05,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:59:05,098 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:59:05,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:59:05,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:59:05,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:59:05,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:59:05,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:59:05,100 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:59:05,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:59:05,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:59:05,101 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-06 22:59:05,391 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:59:05,404 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:59:05,407 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:59:05,408 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:59:05,409 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:59:05,409 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-token-1.i [2019-11-06 22:59:05,486 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62835c7ff/c6ec6dcfcafc4b949b5b0182d0111460/FLAG3ce23c360 [2019-11-06 22:59:06,069 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:59:06,070 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-token-1.i [2019-11-06 22:59:06,083 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62835c7ff/c6ec6dcfcafc4b949b5b0182d0111460/FLAG3ce23c360 [2019-11-06 22:59:06,405 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62835c7ff/c6ec6dcfcafc4b949b5b0182d0111460 [2019-11-06 22:59:06,413 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:59:06,415 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:59:06,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:59:06,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:59:06,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:59:06,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:59:06" (1/1) ... [2019-11-06 22:59:06,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d72cbe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:06, skipping insertion in model container [2019-11-06 22:59:06,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:59:06" (1/1) ... [2019-11-06 22:59:06,431 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:59:06,481 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:59:06,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:59:06,892 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:59:06,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:59:07,034 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:59:07,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:07 WrapperNode [2019-11-06 22:59:07,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:59:07,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:59:07,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:59:07,036 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:59:07,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:07" (1/1) ... [2019-11-06 22:59:07,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:07" (1/1) ... [2019-11-06 22:59:07,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:07" (1/1) ... [2019-11-06 22:59:07,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:07" (1/1) ... [2019-11-06 22:59:07,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:07" (1/1) ... [2019-11-06 22:59:07,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:07" (1/1) ... [2019-11-06 22:59:07,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:07" (1/1) ... [2019-11-06 22:59:07,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:59:07,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:59:07,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:59:07,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:59:07,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:59:07,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:59:07,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:59:07,208 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:59:07,208 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 22:59:07,208 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 22:59:07,208 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 22:59:07,208 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 22:59:07,209 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 22:59:07,209 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 22:59:07,209 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 22:59:07,209 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 22:59:07,209 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 22:59:07,210 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 22:59:07,210 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 22:59:07,210 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 22:59:07,210 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 22:59:07,210 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 22:59:07,210 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 22:59:07,211 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 22:59:07,211 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 22:59:07,211 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 22:59:07,211 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 22:59:07,211 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 22:59:07,211 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 22:59:07,212 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 22:59:07,212 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 22:59:07,212 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 22:59:07,212 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 22:59:07,212 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 22:59:07,212 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 22:59:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 22:59:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 22:59:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 22:59:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 22:59:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 22:59:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 22:59:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 22:59:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 22:59:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 22:59:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 22:59:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 22:59:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 22:59:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 22:59:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 22:59:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 22:59:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 22:59:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 22:59:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 22:59:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 22:59:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 22:59:07,216 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 22:59:07,216 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 22:59:07,216 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 22:59:07,216 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 22:59:07,216 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 22:59:07,216 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 22:59:07,216 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 22:59:07,217 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-06 22:59:07,217 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 22:59:07,217 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 22:59:07,217 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 22:59:07,217 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 22:59:07,217 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 22:59:07,217 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 22:59:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 22:59:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 22:59:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 22:59:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 22:59:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 22:59:07,218 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 22:59:07,219 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 22:59:07,219 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 22:59:07,219 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 22:59:07,219 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 22:59:07,219 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 22:59:07,219 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 22:59:07,219 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 22:59:07,220 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 22:59:07,220 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 22:59:07,220 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 22:59:07,220 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 22:59:07,220 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 22:59:07,220 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 22:59:07,220 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 22:59:07,221 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 22:59:07,221 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 22:59:07,221 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 22:59:07,221 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 22:59:07,221 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 22:59:07,221 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 22:59:07,222 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 22:59:07,222 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 22:59:07,222 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 22:59:07,222 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 22:59:07,222 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 22:59:07,222 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 22:59:07,222 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 22:59:07,223 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 22:59:07,223 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 22:59:07,223 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 22:59:07,223 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 22:59:07,223 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 22:59:07,223 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 22:59:07,223 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 22:59:07,224 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 22:59:07,224 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 22:59:07,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:59:07,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:59:07,224 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:59:07,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 22:59:07,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 22:59:07,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 22:59:07,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 22:59:07,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 22:59:07,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 22:59:07,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:59:07,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:59:07,819 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:59:07,820 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-11-06 22:59:07,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:59:07 BoogieIcfgContainer [2019-11-06 22:59:07,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:59:07,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:59:07,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:59:07,825 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:59:07,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:59:06" (1/3) ... [2019-11-06 22:59:07,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4281016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:59:07, skipping insertion in model container [2019-11-06 22:59:07,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:07" (2/3) ... [2019-11-06 22:59:07,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4281016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:59:07, skipping insertion in model container [2019-11-06 22:59:07,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:59:07" (3/3) ... [2019-11-06 22:59:07,829 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2019-11-06 22:59:07,839 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:59:07,847 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-06 22:59:07,859 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-06 22:59:07,884 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:59:07,884 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:59:07,884 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:59:07,885 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:59:07,885 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:59:07,885 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:59:07,885 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:59:07,886 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:59:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-11-06 22:59:07,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-06 22:59:07,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:07,912 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:07,915 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:07,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:07,921 INFO L82 PathProgramCache]: Analyzing trace with hash 68430596, now seen corresponding path program 1 times [2019-11-06 22:59:07,931 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:07,931 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318587752] [2019-11-06 22:59:07,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:08,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:08,097 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318587752] [2019-11-06 22:59:08,098 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:08,099 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-06 22:59:08,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773121036] [2019-11-06 22:59:08,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-06 22:59:08,111 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:08,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-06 22:59:08,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-06 22:59:08,135 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2019-11-06 22:59:08,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:08,181 INFO L93 Difference]: Finished difference Result 92 states and 138 transitions. [2019-11-06 22:59:08,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:59:08,183 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-06 22:59:08,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:08,200 INFO L225 Difference]: With dead ends: 92 [2019-11-06 22:59:08,200 INFO L226 Difference]: Without dead ends: 43 [2019-11-06 22:59:08,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-06 22:59:08,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-06 22:59:08,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-06 22:59:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-06 22:59:08,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-11-06 22:59:08,272 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 10 [2019-11-06 22:59:08,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:08,273 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-11-06 22:59:08,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-06 22:59:08,274 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-11-06 22:59:08,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-06 22:59:08,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:08,275 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:08,275 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:08,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:08,276 INFO L82 PathProgramCache]: Analyzing trace with hash 67663975, now seen corresponding path program 1 times [2019-11-06 22:59:08,276 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:08,276 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944657248] [2019-11-06 22:59:08,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:08,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:08,461 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944657248] [2019-11-06 22:59:08,462 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:08,462 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:59:08,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566041029] [2019-11-06 22:59:08,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:59:08,464 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:08,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:59:08,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:59:08,465 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 4 states. [2019-11-06 22:59:08,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:08,582 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-11-06 22:59:08,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:59:08,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-06 22:59:08,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:08,584 INFO L225 Difference]: With dead ends: 43 [2019-11-06 22:59:08,584 INFO L226 Difference]: Without dead ends: 41 [2019-11-06 22:59:08,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:59:08,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-06 22:59:08,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-06 22:59:08,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-06 22:59:08,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-11-06 22:59:08,591 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 10 [2019-11-06 22:59:08,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:08,592 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-11-06 22:59:08,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:59:08,592 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-11-06 22:59:08,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-06 22:59:08,593 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:08,593 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:08,593 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:08,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:08,594 INFO L82 PathProgramCache]: Analyzing trace with hash 2097539711, now seen corresponding path program 1 times [2019-11-06 22:59:08,594 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:08,594 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273366814] [2019-11-06 22:59:08,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:08,650 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273366814] [2019-11-06 22:59:08,650 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:08,650 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:59:08,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731934126] [2019-11-06 22:59:08,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:59:08,651 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:08,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:59:08,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:59:08,652 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 4 states. [2019-11-06 22:59:08,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:08,748 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-11-06 22:59:08,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:59:08,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-06 22:59:08,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:08,751 INFO L225 Difference]: With dead ends: 67 [2019-11-06 22:59:08,751 INFO L226 Difference]: Without dead ends: 65 [2019-11-06 22:59:08,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:59:08,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-06 22:59:08,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2019-11-06 22:59:08,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-06 22:59:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-11-06 22:59:08,758 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 11 [2019-11-06 22:59:08,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:08,759 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-11-06 22:59:08,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:59:08,759 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-11-06 22:59:08,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 22:59:08,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:08,760 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:08,760 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:08,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:08,761 INFO L82 PathProgramCache]: Analyzing trace with hash -409997773, now seen corresponding path program 1 times [2019-11-06 22:59:08,761 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:08,761 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234367730] [2019-11-06 22:59:08,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:08,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:08,831 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234367730] [2019-11-06 22:59:08,831 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:08,831 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:59:08,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926289320] [2019-11-06 22:59:08,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:59:08,835 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:08,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:59:08,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:59:08,835 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 5 states. [2019-11-06 22:59:08,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:08,967 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-11-06 22:59:08,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:59:08,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-06 22:59:08,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:08,969 INFO L225 Difference]: With dead ends: 39 [2019-11-06 22:59:08,969 INFO L226 Difference]: Without dead ends: 37 [2019-11-06 22:59:08,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:59:08,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-06 22:59:08,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-06 22:59:08,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-06 22:59:08,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-11-06 22:59:08,975 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 16 [2019-11-06 22:59:08,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:08,976 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-11-06 22:59:08,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:59:08,976 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-11-06 22:59:08,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 22:59:08,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:08,977 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:08,977 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:08,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:08,978 INFO L82 PathProgramCache]: Analyzing trace with hash -409960037, now seen corresponding path program 1 times [2019-11-06 22:59:08,978 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:08,978 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881870658] [2019-11-06 22:59:08,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:09,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:09,131 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881870658] [2019-11-06 22:59:09,131 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:09,132 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:59:09,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227257411] [2019-11-06 22:59:09,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:59:09,132 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:09,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:59:09,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:59:09,133 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 5 states. [2019-11-06 22:59:09,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:09,300 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2019-11-06 22:59:09,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:59:09,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-06 22:59:09,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:09,302 INFO L225 Difference]: With dead ends: 72 [2019-11-06 22:59:09,302 INFO L226 Difference]: Without dead ends: 48 [2019-11-06 22:59:09,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:59:09,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-06 22:59:09,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2019-11-06 22:59:09,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-06 22:59:09,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-11-06 22:59:09,318 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 16 [2019-11-06 22:59:09,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:09,321 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-11-06 22:59:09,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:59:09,321 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-11-06 22:59:09,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 22:59:09,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:09,322 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:09,323 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:09,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:09,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1407314597, now seen corresponding path program 1 times [2019-11-06 22:59:09,323 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:09,323 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319478126] [2019-11-06 22:59:09,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:09,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:09,515 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319478126] [2019-11-06 22:59:09,516 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:09,516 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 22:59:09,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918595214] [2019-11-06 22:59:09,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:59:09,518 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:09,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:59:09,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:59:09,519 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 6 states. [2019-11-06 22:59:09,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:09,689 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-11-06 22:59:09,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:59:09,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-06 22:59:09,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:09,691 INFO L225 Difference]: With dead ends: 54 [2019-11-06 22:59:09,691 INFO L226 Difference]: Without dead ends: 52 [2019-11-06 22:59:09,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:59:09,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-06 22:59:09,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2019-11-06 22:59:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-06 22:59:09,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-11-06 22:59:09,699 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 20 [2019-11-06 22:59:09,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:09,699 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-11-06 22:59:09,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:59:09,700 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-11-06 22:59:09,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 22:59:09,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:09,701 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:09,701 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:09,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:09,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1742673852, now seen corresponding path program 1 times [2019-11-06 22:59:09,702 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:09,702 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89410936] [2019-11-06 22:59:09,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:09,866 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89410936] [2019-11-06 22:59:09,866 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525503081] [2019-11-06 22:59:09,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:59:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:10,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-06 22:59:10,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:59:10,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 22:59:10,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:10,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:10,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 22:59:10,150 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:10,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:10,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:59:10,163 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-11-06 22:59:10,239 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:10,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 22:59:10,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:10,339 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.4 percent of original size [2019-11-06 22:59:10,352 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:10,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:10,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:10,438 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 20 [2019-11-06 22:59:10,439 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:10,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:10,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:10,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:10,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-11-06 22:59:10,487 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:10,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:10,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:10,514 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:10,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:10,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:59:10,534 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:109, output treesize:36 [2019-11-06 22:59:10,592 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:10,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-06 22:59:10,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:10,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:10,647 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_21|, |v_#memory_int_31|, |v_#memory_$Pointer$.base_21|, |v_#memory_int_32|], 10=[|v_#memory_int_34|]} [2019-11-06 22:59:10,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:10,651 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:10,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:10,693 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:10,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:10,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:10,735 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:10,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:10,762 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:10,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:10,810 INFO L341 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2019-11-06 22:59:10,811 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 48 [2019-11-06 22:59:10,811 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:10,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:10,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:10,833 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:181, output treesize:41 [2019-11-06 22:59:10,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-11-06 22:59:10,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:10,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:10,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:59:10,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-11-06 22:59:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:10,918 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:59:10,928 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_21|, |v_#memory_$Pointer$.base_21|, |v_#memory_int_32|], 3=[|v_#memory_int_31|]} [2019-11-06 22:59:10,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:11,057 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-11-06 22:59:11,058 INFO L567 ElimStorePlain]: treesize reduction 11, result has 95.1 percent of original size [2019-11-06 22:59:11,072 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:11,177 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2019-11-06 22:59:11,177 INFO L567 ElimStorePlain]: treesize reduction 79, result has 54.6 percent of original size [2019-11-06 22:59:11,181 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:11,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:11,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:11,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:11,248 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:11,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:11,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:11,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:11,282 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:157, output treesize:157 [2019-11-06 22:59:11,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:11,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:19,526 WARN L191 SmtUtils]: Spent 6.12 s on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-11-06 22:59:19,545 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|, |v_#memory_int_29|], 6=[|v_#memory_int_30|]} [2019-11-06 22:59:19,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:19,677 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-11-06 22:59:19,678 INFO L567 ElimStorePlain]: treesize reduction 70, result has 60.5 percent of original size [2019-11-06 22:59:19,681 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:19,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:19,710 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:19,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:19,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:19,729 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:227, output treesize:113 [2019-11-06 22:59:19,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:19,911 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:59:19,911 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 6] total 12 [2019-11-06 22:59:19,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636998796] [2019-11-06 22:59:19,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 22:59:19,912 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:19,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 22:59:19,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=94, Unknown=1, NotChecked=0, Total=132 [2019-11-06 22:59:19,912 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 7 states. [2019-11-06 22:59:24,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:24,987 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2019-11-06 22:59:24,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:59:24,987 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-06 22:59:24,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:24,988 INFO L225 Difference]: With dead ends: 62 [2019-11-06 22:59:24,988 INFO L226 Difference]: Without dead ends: 60 [2019-11-06 22:59:24,989 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=55, Invalid=154, Unknown=1, NotChecked=0, Total=210 [2019-11-06 22:59:24,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-06 22:59:24,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2019-11-06 22:59:24,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-06 22:59:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-11-06 22:59:24,996 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 20 [2019-11-06 22:59:24,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:24,996 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-11-06 22:59:24,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 22:59:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-11-06 22:59:24,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 22:59:24,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:24,997 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:25,207 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:59:25,208 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:25,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:25,209 INFO L82 PathProgramCache]: Analyzing trace with hash 995688324, now seen corresponding path program 1 times [2019-11-06 22:59:25,209 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:25,209 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921224253] [2019-11-06 22:59:25,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:25,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:25,441 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921224253] [2019-11-06 22:59:25,441 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871103746] [2019-11-06 22:59:25,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:59:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:25,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-06 22:59:25,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:59:25,559 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 22:59:25,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:25,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:25,584 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 22:59:25,585 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:25,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:25,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:59:25,610 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-11-06 22:59:25,663 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:25,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 22:59:25,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:25,748 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.7 percent of original size [2019-11-06 22:59:25,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:25,754 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:25,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:25,791 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:25,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:25,829 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:25,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:25,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:25,879 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:25,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 64 [2019-11-06 22:59:25,881 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:25,938 INFO L567 ElimStorePlain]: treesize reduction 18, result has 78.6 percent of original size [2019-11-06 22:59:25,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:59:25,940 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:112, output treesize:36 [2019-11-06 22:59:25,994 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:25,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-06 22:59:25,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:26,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:26,042 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.offset_25|, |v_#memory_int_41|, |v_#memory_int_42|], 10=[|v_#memory_int_44|]} [2019-11-06 22:59:26,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:26,046 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:26,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:26,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:26,088 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:26,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:26,125 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:26,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:26,154 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:26,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:26,201 INFO L341 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2019-11-06 22:59:26,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 48 [2019-11-06 22:59:26,202 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:26,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:26,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:26,233 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:181, output treesize:41 [2019-11-06 22:59:26,278 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-11-06 22:59:26,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:26,284 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:26,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:59:26,285 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-11-06 22:59:26,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:26,303 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:59:26,333 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.offset_25|, |v_#memory_int_42|], 3=[|v_#memory_int_41|]} [2019-11-06 22:59:26,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:26,442 INFO L567 ElimStorePlain]: treesize reduction 70, result has 58.3 percent of original size [2019-11-06 22:59:26,447 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:26,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:26,512 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:26,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:26,771 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:59:26,772 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:178) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:83) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:294) ... 21 more [2019-11-06 22:59:26,779 INFO L168 Benchmark]: Toolchain (without parser) took 20364.38 ms. Allocated memory was 138.9 MB in the beginning and 272.6 MB in the end (delta: 133.7 MB). Free memory was 100.6 MB in the beginning and 126.9 MB in the end (delta: -26.4 MB). Peak memory consumption was 107.3 MB. Max. memory is 7.1 GB. [2019-11-06 22:59:26,780 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-06 22:59:26,781 INFO L168 Benchmark]: CACSL2BoogieTranslator took 619.76 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 100.3 MB in the beginning and 169.3 MB in the end (delta: -68.9 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2019-11-06 22:59:26,781 INFO L168 Benchmark]: Boogie Preprocessor took 108.03 ms. Allocated memory is still 202.4 MB. Free memory was 169.3 MB in the beginning and 166.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-11-06 22:59:26,782 INFO L168 Benchmark]: RCFGBuilder took 676.78 ms. Allocated memory is still 202.4 MB. Free memory was 166.1 MB in the beginning and 119.4 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-11-06 22:59:26,783 INFO L168 Benchmark]: TraceAbstraction took 18955.33 ms. Allocated memory was 202.4 MB in the beginning and 272.6 MB in the end (delta: 70.3 MB). Free memory was 119.4 MB in the beginning and 126.9 MB in the end (delta: -7.5 MB). Peak memory consumption was 62.7 MB. Max. memory is 7.1 GB. [2019-11-06 22:59:26,786 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 619.76 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 100.3 MB in the beginning and 169.3 MB in the end (delta: -68.9 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 108.03 ms. Allocated memory is still 202.4 MB. Free memory was 169.3 MB in the beginning and 166.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 676.78 ms. Allocated memory is still 202.4 MB. Free memory was 166.1 MB in the beginning and 119.4 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18955.33 ms. Allocated memory was 202.4 MB in the beginning and 272.6 MB in the end (delta: 70.3 MB). Free memory was 119.4 MB in the beginning and 126.9 MB in the end (delta: -7.5 MB). Peak memory consumption was 62.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:302) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...