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/array-tiling/rewnifrev.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:52:55,965 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:52:55,968 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:52:55,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:52:55,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:52:55,982 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:52:55,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:52:55,985 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:52:55,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:52:55,988 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:52:55,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:52:55,990 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:52:55,991 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:52:55,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:52:55,993 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:52:55,994 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:52:55,995 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:52:55,996 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:52:55,998 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:52:56,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:52:56,002 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:52:56,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:52:56,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:52:56,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:52:56,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:52:56,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:52:56,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:52:56,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:52:56,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:52:56,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:52:56,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:52:56,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:52:56,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:52:56,014 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:52:56,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:52:56,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:52:56,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:52:56,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:52:56,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:52:56,017 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:52:56,018 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:52:56,019 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:52:56,034 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:52:56,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:52:56,035 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:52:56,036 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:52:56,036 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:52:56,036 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:52:56,036 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:52:56,037 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:52:56,037 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:52:56,037 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:52:56,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:52:56,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:52:56,038 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:52:56,038 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:52:56,038 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:52:56,041 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:52:56,041 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:52:56,042 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:52:56,042 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:52:56,042 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:52:56,042 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:52:56,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:52:56,042 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:52:56,043 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:52:56,043 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:52:56,043 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:52:56,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:52:56,043 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:52:56,044 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-14 23:52:56,351 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:52:56,370 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:52:56,374 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:52:56,375 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:52:56,376 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:52:56,377 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/rewnifrev.c [2019-10-14 23:52:56,463 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06a03d66e/d0ffac624dc044e7a31b836fa7609b2e/FLAGd9a8522eb [2019-10-14 23:52:56,959 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:52:56,960 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/rewnifrev.c [2019-10-14 23:52:56,967 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06a03d66e/d0ffac624dc044e7a31b836fa7609b2e/FLAGd9a8522eb [2019-10-14 23:52:57,289 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06a03d66e/d0ffac624dc044e7a31b836fa7609b2e [2019-10-14 23:52:57,301 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:52:57,302 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:52:57,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:52:57,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:52:57,311 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:52:57,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:52:57" (1/1) ... [2019-10-14 23:52:57,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3414aba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:57, skipping insertion in model container [2019-10-14 23:52:57,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:52:57" (1/1) ... [2019-10-14 23:52:57,324 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:52:57,343 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:52:57,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:52:57,604 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:52:57,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:52:57,650 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:52:57,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:57 WrapperNode [2019-10-14 23:52:57,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:52:57,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:52:57,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:52:57,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:52:57,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:57" (1/1) ... [2019-10-14 23:52:57,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:57" (1/1) ... [2019-10-14 23:52:57,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:57" (1/1) ... [2019-10-14 23:52:57,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:57" (1/1) ... [2019-10-14 23:52:57,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:57" (1/1) ... [2019-10-14 23:52:57,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:57" (1/1) ... [2019-10-14 23:52:57,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:57" (1/1) ... [2019-10-14 23:52:57,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:52:57,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:52:57,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:52:57,803 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:52:57,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:52:57,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:52:57,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:52:57,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 23:52:57,865 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:52:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:52:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:52:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 23:52:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:52:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 23:52:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:52:57,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 23:52:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:52:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:52:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:52:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:52:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:52:58,179 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:52:58,180 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-14 23:52:58,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:52:58 BoogieIcfgContainer [2019-10-14 23:52:58,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:52:58,182 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:52:58,182 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:52:58,185 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:52:58,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:52:57" (1/3) ... [2019-10-14 23:52:58,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec03eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:52:58, skipping insertion in model container [2019-10-14 23:52:58,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:57" (2/3) ... [2019-10-14 23:52:58,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec03eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:52:58, skipping insertion in model container [2019-10-14 23:52:58,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:52:58" (3/3) ... [2019-10-14 23:52:58,189 INFO L109 eAbstractionObserver]: Analyzing ICFG rewnifrev.c [2019-10-14 23:52:58,197 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:52:58,204 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:52:58,215 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:52:58,239 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:52:58,240 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:52:58,240 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:52:58,240 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:52:58,240 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:52:58,240 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:52:58,241 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:52:58,241 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:52:58,259 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-14 23:52:58,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 23:52:58,267 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:58,268 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:58,270 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:58,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:58,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1294486485, now seen corresponding path program 1 times [2019-10-14 23:52:58,283 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:58,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260384144] [2019-10-14 23:52:58,284 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:58,284 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:58,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:58,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:52:58,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260384144] [2019-10-14 23:52:58,426 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:58,426 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-14 23:52:58,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425067447] [2019-10-14 23:52:58,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-14 23:52:58,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:58,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-14 23:52:58,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-14 23:52:58,449 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-10-14 23:52:58,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:58,478 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-10-14 23:52:58,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-14 23:52:58,480 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-10-14 23:52:58,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:58,486 INFO L225 Difference]: With dead ends: 43 [2019-10-14 23:52:58,487 INFO L226 Difference]: Without dead ends: 22 [2019-10-14 23:52:58,490 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-14 23:52:58,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-14 23:52:58,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-14 23:52:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-14 23:52:58,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-14 23:52:58,526 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2019-10-14 23:52:58,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:58,527 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-14 23:52:58,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-14 23:52:58,527 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-14 23:52:58,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 23:52:58,528 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:58,528 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:58,528 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:58,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:58,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1653126776, now seen corresponding path program 1 times [2019-10-14 23:52:58,530 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:58,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409663925] [2019-10-14 23:52:58,530 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:58,530 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:58,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:58,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:52:58,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409663925] [2019-10-14 23:52:58,601 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:58,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:52:58,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29214742] [2019-10-14 23:52:58,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:52:58,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:58,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:52:58,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:52:58,605 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2019-10-14 23:52:58,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:58,661 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-10-14 23:52:58,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:52:58,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-14 23:52:58,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:58,663 INFO L225 Difference]: With dead ends: 41 [2019-10-14 23:52:58,663 INFO L226 Difference]: Without dead ends: 26 [2019-10-14 23:52:58,664 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:52:58,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-14 23:52:58,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-10-14 23:52:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-14 23:52:58,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-14 23:52:58,671 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2019-10-14 23:52:58,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:58,672 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-14 23:52:58,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:52:58,672 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-14 23:52:58,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:52:58,673 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:58,673 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:58,674 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:58,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:58,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1007604157, now seen corresponding path program 1 times [2019-10-14 23:52:58,675 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:58,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927997742] [2019-10-14 23:52:58,675 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:58,675 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:58,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:58,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:52:58,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927997742] [2019-10-14 23:52:58,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:58,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:52:58,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508930157] [2019-10-14 23:52:58,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:52:58,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:58,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:52:58,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:52:58,764 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 4 states. [2019-10-14 23:52:58,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:58,823 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-10-14 23:52:58,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:52:58,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-14 23:52:58,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:58,826 INFO L225 Difference]: With dead ends: 42 [2019-10-14 23:52:58,827 INFO L226 Difference]: Without dead ends: 31 [2019-10-14 23:52:58,827 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:52:58,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-14 23:52:58,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2019-10-14 23:52:58,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-14 23:52:58,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-10-14 23:52:58,842 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2019-10-14 23:52:58,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:58,843 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-10-14 23:52:58,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:52:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-10-14 23:52:58,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:52:58,845 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:58,845 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:58,845 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:58,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:58,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2051596356, now seen corresponding path program 1 times [2019-10-14 23:52:58,846 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:58,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701395923] [2019-10-14 23:52:58,847 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:58,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:58,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:52:59,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701395923] [2019-10-14 23:52:59,277 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:59,278 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:52:59,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079582632] [2019-10-14 23:52:59,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:52:59,279 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:59,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:52:59,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:52:59,280 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 10 states. [2019-10-14 23:52:59,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:59,494 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-10-14 23:52:59,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:52:59,494 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-10-14 23:52:59,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:59,495 INFO L225 Difference]: With dead ends: 39 [2019-10-14 23:52:59,496 INFO L226 Difference]: Without dead ends: 37 [2019-10-14 23:52:59,496 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:52:59,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-14 23:52:59,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2019-10-14 23:52:59,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-14 23:52:59,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-10-14 23:52:59,505 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2019-10-14 23:52:59,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:59,506 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-10-14 23:52:59,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:52:59,506 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-10-14 23:52:59,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:52:59,507 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:59,508 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:59,509 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:59,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:59,509 INFO L82 PathProgramCache]: Analyzing trace with hash -730987952, now seen corresponding path program 1 times [2019-10-14 23:52:59,509 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:59,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971547748] [2019-10-14 23:52:59,510 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:59,510 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:59,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:59,778 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:52:59,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971547748] [2019-10-14 23:52:59,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910233403] [2019-10-14 23:52:59,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:52:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:59,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-14 23:52:59,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:52:59,954 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 19 treesize of output 15 [2019-10-14 23:52:59,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:52:59,963 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 19 treesize of output 15 [2019-10-14 23:52:59,963 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:52:59,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:52:59,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-14 23:52:59,985 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:31 [2019-10-14 23:53:00,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:00,120 INFO L341 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-10-14 23:53:00,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2019-10-14 23:53:00,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:53:00,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:53:00,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:53:00,128 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-10-14 23:53:00,380 INFO L341 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2019-10-14 23:53:00,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 36 [2019-10-14 23:53:00,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:00,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:00,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-14 23:53:00,406 INFO L567 ElimStorePlain]: treesize reduction 31, result has 18.4 percent of original size [2019-10-14 23:53:00,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:53:00,407 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2019-10-14 23:53:00,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:00,498 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:53:00,498 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:53:00,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:00,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-10-14 23:53:00,797 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2019-10-14 23:53:00,798 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:53:00,821 INFO L567 ElimStorePlain]: treesize reduction 43, result has 30.6 percent of original size [2019-10-14 23:53:00,822 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:53:00,837 INFO L567 ElimStorePlain]: treesize reduction 9, result has 66.7 percent of original size [2019-10-14 23:53:00,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:53:00,838 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:13 [2019-10-14 23:53:00,851 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:53:00,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [786782094] [2019-10-14 23:53:00,859 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 31 [2019-10-14 23:53:00,908 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-14 23:53:00,908 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-14 23:53:01,015 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-14 23:53:01,017 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 24 root evaluator evaluations with a maximum evaluation depth of 3. Performed 24 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 25 variables. [2019-10-14 23:53:01,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:53:01,022 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-14 23:53:01,077 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 77.5% of their original sizes. [2019-10-14 23:53:01,078 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-14 23:53:01,089 INFO L553 sIntCurrentIteration]: We unified 29 AI predicates to 29 [2019-10-14 23:53:01,092 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-14 23:53:01,093 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-14 23:53:01,093 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12, 15, 12] total 32 [2019-10-14 23:53:01,094 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260850580] [2019-10-14 23:53:01,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:53:01,097 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-14 23:53:01,098 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-14 23:53:01,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:53:01,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:53:01,098 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 4 states. [2019-10-14 23:53:01,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:53:01,102 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-10-14 23:53:01,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:53:01,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-10-14 23:53:01,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:53:01,103 INFO L225 Difference]: With dead ends: 33 [2019-10-14 23:53:01,103 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:53:01,104 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:53:01,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:53:01,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:53:01,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:53:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:53:01,104 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2019-10-14 23:53:01,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:53:01,105 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:53:01,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:53:01,105 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:53:01,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:53:01,308 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:53:01,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:53:01,391 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:53:01,391 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:53:01,391 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:53:01,392 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:53:01,392 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 (+ ~SIZE~0 2147483648)) (<= ~SIZE~0 2147483647) (= ~MAX~0 100000)) [2019-10-14 23:53:01,392 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:53:01,392 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:53:01,392 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 11 34) no Hoare annotation was computed. [2019-10-14 23:53:01,392 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 24) no Hoare annotation was computed. [2019-10-14 23:53:01,393 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 21 24) no Hoare annotation was computed. [2019-10-14 23:53:01,393 INFO L443 ceAbstractionStarter]: For program point L19-2(lines 19 26) no Hoare annotation was computed. [2019-10-14 23:53:01,393 INFO L439 ceAbstractionStarter]: At program point L19-3(lines 19 26) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:53:01,393 INFO L443 ceAbstractionStarter]: For program point L19-4(lines 19 26) no Hoare annotation was computed. [2019-10-14 23:53:01,393 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 11 34) no Hoare annotation was computed. [2019-10-14 23:53:01,393 INFO L439 ceAbstractionStarter]: At program point L30(line 30) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:53:01,394 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 11 34) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648))) (and (<= 0 (+ ~SIZE~0 2147483648)) (<= ~SIZE~0 2147483647))) [2019-10-14 23:53:01,394 INFO L443 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. [2019-10-14 23:53:01,394 INFO L443 ceAbstractionStarter]: For program point L28-2(lines 28 31) no Hoare annotation was computed. [2019-10-14 23:53:01,394 INFO L439 ceAbstractionStarter]: At program point L28-3(lines 28 31) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:53:01,395 INFO L443 ceAbstractionStarter]: For program point L14(lines 14 32) no Hoare annotation was computed. [2019-10-14 23:53:01,395 INFO L443 ceAbstractionStarter]: For program point L14-1(lines 14 32) no Hoare annotation was computed. [2019-10-14 23:53:01,395 INFO L443 ceAbstractionStarter]: For program point L3-3(line 3) no Hoare annotation was computed. [2019-10-14 23:53:01,395 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 3) the Hoare annotation is: true [2019-10-14 23:53:01,395 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2019-10-14 23:53:01,395 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 3) no Hoare annotation was computed. [2019-10-14 23:53:01,395 INFO L443 ceAbstractionStarter]: For program point L3(line 3) no Hoare annotation was computed. [2019-10-14 23:53:01,396 INFO L443 ceAbstractionStarter]: For program point L3-1(line 3) no Hoare annotation was computed. [2019-10-14 23:53:01,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:53:01 BoogieIcfgContainer [2019-10-14 23:53:01,415 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:53:01,423 INFO L168 Benchmark]: Toolchain (without parser) took 4114.87 ms. Allocated memory was 144.2 MB in the beginning and 249.0 MB in the end (delta: 104.9 MB). Free memory was 102.2 MB in the beginning and 178.4 MB in the end (delta: -76.2 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. [2019-10-14 23:53:01,424 INFO L168 Benchmark]: CDTParser took 1.65 ms. Allocated memory is still 144.2 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-14 23:53:01,425 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.68 ms. Allocated memory is still 144.2 MB. Free memory was 102.0 MB in the beginning and 92.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:53:01,426 INFO L168 Benchmark]: Boogie Preprocessor took 150.55 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 92.1 MB in the beginning and 178.6 MB in the end (delta: -86.5 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:53:01,427 INFO L168 Benchmark]: RCFGBuilder took 377.88 ms. Allocated memory is still 200.8 MB. Free memory was 178.6 MB in the beginning and 164.0 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2019-10-14 23:53:01,430 INFO L168 Benchmark]: TraceAbstraction took 3233.15 ms. Allocated memory was 200.8 MB in the beginning and 249.0 MB in the end (delta: 48.2 MB). Free memory was 163.3 MB in the beginning and 178.4 MB in the end (delta: -15.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 7.1 GB. [2019-10-14 23:53:01,440 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.65 ms. Allocated memory is still 144.2 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 344.68 ms. Allocated memory is still 144.2 MB. Free memory was 102.0 MB in the beginning and 92.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 150.55 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 92.1 MB in the beginning and 178.6 MB in the end (delta: -86.5 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 377.88 ms. Allocated memory is still 200.8 MB. Free memory was 178.6 MB in the beginning and 164.0 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3233.15 ms. Allocated memory was 200.8 MB in the beginning and 249.0 MB in the end (delta: 48.2 MB). Free memory was 163.3 MB in the beginning and 178.4 MB in the end (delta: -15.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Result: SAFE, OverallTime: 3.1s, OverallIterations: 5, TraceHistogramMax: 2, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 92 SDtfs, 47 SDslu, 93 SDs, 0 SdLazy, 118 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 12 PreInvPairs, 12 NumberOfFragments, 84 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 3 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 151 ConstructedInterpolants, 7 QuantifiedInterpolants, 26311 SizeOfPredicates, 13 NumberOfNonLiveVariables, 104 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 23/37 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 164, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9741379310344828, AVG_VARS_REMOVED_DURING_WEAKENING: 0.7241379310344828, AVG_WEAKENED_CONJUNCTS: 0.7586206896551724, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...